| recurseFirstIntersection(BSPTree, Vector3D, Line) |   | 88% | | 70% | 5 | 11 | 3 | 27 | 0 | 1 |
| boundaryFacet(Vector3D, BSPTree) | | 73% | | 50% | 3 | 5 | 2 | 10 | 0 | 1 |
| PolyhedronsSet(PolyhedronsSet.BRep, double) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| computeGeometricalProperties() | | 82% | | 50% | 1 | 2 | 2 | 7 | 0 | 1 |
| buildBoundary(List, List, double) | | 100% | | 100% | 0 | 14 | 0 | 33 | 0 | 1 |
| successors(List, List, int[][]) | | 100% | | 93% | 1 | 9 | 0 | 18 | 0 | 1 |
| findReferences(List, List) | | 100% | | 93% | 1 | 9 | 0 | 19 | 0 | 1 |
| buildBoundary(double, double, double, double, double, double, double) | | 100% | | 66% | 2 | 4 | 0 | 11 | 0 | 1 |
| getBRep() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| PolyhedronsSet(double, double, double, double, double, double, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| rotate(Vector3D, Rotation) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| PolyhedronsSet(List, List, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| firstIntersection(Vector3D, Line) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| translate(Vector3D) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| buildNew(BSPTree) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| PolyhedronsSet(BSPTree, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| PolyhedronsSet(Collection, double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| PolyhedronsSet(double) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |