| recurseIntersection(int, ExtendedEllipsoid, Vector3D, Vector3D, MinMaxTreeTile, NormalizedGeodeticPoint, int, int, NormalizedGeodeticPoint, int, int) |   | 92% | | 82% | 10 | 29 | 6 | 74 | 0 | 1 |
| intersection(ExtendedEllipsoid, Vector3D, Vector3D) | | 84% | | 69% | 4 | 9 | 8 | 37 | 0 | 1 |
| refineIntersection(ExtendedEllipsoid, Vector3D, Vector3D, NormalizedGeodeticPoint) | | 92% | | 100% | 0 | 3 | 2 | 15 | 0 | 1 |
| findExit(Tile, ExtendedEllipsoid, Vector3D, Vector3D) | | 99% | | 90% | 1 | 10 | 1 | 14 | 0 | 1 |
| getElevation(double, double) | | 89% | | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
| noRecurseIntersection(ExtendedEllipsoid, Vector3D, Vector3D, MinMaxTreeTile, NormalizedGeodeticPoint, int, int, int, int) | | 100% | | 100% | 0 | 6 | 0 | 18 | 0 | 1 |
| DuvenhageAlgorithm(TileUpdater, int, boolean) | | 100% | | n/a | 0 | 1 | 0 | 4 | 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 |