| createSegmentStrings(Geometry, boolean) |  | 0% | | 0% | 9 | 9 | 19 | 19 | 1 | 1 |
| isIncidentSegmentInRing(Coordinate, Coordinate, Coordinate[]) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| intersectingSegIndex(Coordinate[], Coordinate) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| getPolygonRings(List) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| isRingNested(LinearRing, LinearRing) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| analyze(Geometry) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| findNonEqualVertex(LinearRing, Coordinate) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| isInteriorDisconnected() | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| findRingVertexNext(Coordinate[], int, Coordinate) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| findRingVertexPrev(Coordinate[], int, Coordinate) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| analyzeIntersections(List) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| createSegString(LinearRing, PolygonRing) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| PolygonTopologyAnalyzer(Geometry, boolean) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| findSelfIntersection(LinearRing) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| ringIndexNext(Coordinate[], int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| ringIndexPrev(Coordinate[], int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| checkInteriorDisconnectedByHoleCycle() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| checkInteriorDisconnectedBySelfTouch() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| hasInvalidIntersection() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getInvalidCode() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getInvalidLocation() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getDisconnectionLocation() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |