| recurseIntersection(int, ExtendedEllipsoid, Vector3D, Vector3D, MinMaxTreeTile, NormalizedGeodeticPoint, int, int, NormalizedGeodeticPoint, int, int) |   | 91% | | 83% | 9 | 29 | 6 | 94 | 0 | 1 |
| intersection(ExtendedEllipsoid, Vector3D, Vector3D) | | 85% | | 60% | 6 | 11 | 10 | 55 | 0 | 1 |
| refineIntersection(ExtendedEllipsoid, Vector3D, Vector3D, NormalizedGeodeticPoint) | | 96% | | 66% | 4 | 7 | 2 | 45 | 0 | 1 |
| findExit(Tile, ExtendedEllipsoid, Vector3D, Vector3D) | | 97% | | 90% | 1 | 10 | 1 | 26 | 0 | 1 |
| noRecurseIntersection(ExtendedEllipsoid, Vector3D, Vector3D, MinMaxTreeTile, NormalizedGeodeticPoint, int, int, int, int) | | 100% | | 100% | 0 | 7 | 0 | 24 | 0 | 1 |
| DuvenhageAlgorithm(TileUpdater, int, boolean) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getElevation(double, double) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| searchDomainSize(int, int, int, int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| inRange(int, int, int) | | 100% | | 75% | 1 | 3 | 0 | 1 | 0 | 1 |
| selectClosest(Vector3D, Vector3D, Vector3D) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| latitudeCrossing(ExtendedEllipsoid, Vector3D, Vector3D, double, Vector3D) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| longitudeCrossing(ExtendedEllipsoid, Vector3D, Vector3D, double, Vector3D) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| getAlgorithmId() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |