| projectToBoundary(Vector1D) |   | 59% | | 60% | 3 | 6 | 6 | 18 | 0 | 1 |
| getInf() | | 92% | | 83% | 1 | 4 | 0 | 8 | 0 | 1 |
| finiteOrNullPoint(double) | | 80% | | 50% | 1 | 2 | 0 | 1 | 0 | 1 |
| computeGeometricalProperties() | | 98% | | 90% | 1 | 6 | 0 | 16 | 0 | 1 |
| buildTree(double, double, double) | | 100% | | 75% | 3 | 7 | 0 | 10 | 0 | 1 |
| getInteriorPoint() | | 100% | | 100% | 0 | 7 | 0 | 13 | 0 | 1 |
| getSup() | | 100% | | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
| getFirstIntervalBoundary() | | 100% | | 87% | 1 | 5 | 0 | 7 | 0 | 1 |
| asList() | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getFirstLeaf(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
| nextInternalNode(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| previousInternalNode(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isIntervalStart(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isIntervalEnd(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isBeforeParent(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 4 | 0 | 1 |
| isAfterParent(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 4 | 0 | 1 |
| leafBefore(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| leafAfter(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| childBefore(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| childAfter(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| IntervalsSet(double, double, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getAngle(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| buildNew(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isDirect(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| IntervalsSet(BSPTree, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| IntervalsSet(Collection, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| iterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| IntervalsSet(double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |