| computeTargetEdgeLength(List, double) |  | 0% | | 0% | 8 | 8 | 14 | 14 | 1 | 1 |
| removeHole(List, HullTri) | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| computeHullBorder(List) | | 0% | | 0% | 4 | 4 | 15 | 15 | 1 | 1 |
| getHull() | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| findCandidateHoles(List, double) | | 0% | | 0% | 6 | 6 | 9 | 9 | 1 | 1 |
| computeHullHoles(List) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| ConcaveHull(Geometry) | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| setSize(List) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| createBorderQueue(List) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| setMaximumEdgeLengthRatio(double) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| setMaximumEdgeLength(double) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| addBorderTri(HullTri, PriorityQueue) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| concaveHullByLength(Geometry, double, boolean) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| concaveHullByLengthRatio(Geometry, double, boolean) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| alphaShape(Geometry, double, boolean) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| uniformGridEdgeLength(Geometry) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| isRemovableBorder(HullTri) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| isRemovableHole(HullTri) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| toGeometry(List, GeometryFactory) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| setAlpha(double) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| computeHull(List) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setSize(HullTri) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| isInHull(HullTri) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| concaveHullByLength(Geometry, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| concaveHullByLengthRatio(Geometry, double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setHolesAllowed(boolean) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |