| projectToBoundary(S1Point) |   | 59% | | 62% | 7 | 13 | 11 | 37 | 0 | 1 |
| createSplitPart(List) | | 88% | | 81% | 2 | 9 | 3 | 25 | 0 | 1 |
| computeGeometricalProperties() | | 96% | | 90% | 1 | 6 | 1 | 18 | 0 | 1 |
| addArcLimit(BSPTree, double, boolean) | | 95% | | 75% | 1 | 3 | 1 | 9 | 0 | 1 |
| getLastLeaf(BSPTree) | | 90% | | 75% | 1 | 3 | 1 | 6 | 0 | 1 |
| split(Arc) | | 100% | | 100% | 0 | 7 | 0 | 39 | 0 | 1 |
| buildTree(double, double, double) | | 100% | | 87% | 1 | 5 | 0 | 14 | 0 | 1 |
| getInteriorPoint() | | 100% | | 100% | 0 | 4 | 0 | 9 | 0 | 1 |
| check2PiConsistency() | | 100% | | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| asList() | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getFirstArcStart() | | 100% | | 83% | 1 | 4 | 0 | 7 | 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 |
| isArcStart(BSPTree) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isArcEnd(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 |
| ArcsSet(double, double, double) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| childBefore(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| childAfter(BSPTree) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| ArcsSet(BSPTree, double) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| ArcsSet(Collection, double) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| getAngle(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isDirect(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| buildNew(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| ArcsSet(double) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| iterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |