Package | Description |
---|---|
org.locationtech.jts.geomgraph |
Contains classes that implement topology graphs.
|
org.locationtech.jts.operation |
Provides classes for implementing operations on geometries
|
org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometry s. |
org.locationtech.jts.operation.valid |
Provides classes for testing the validity of geometries.
|
Modifier and Type | Method and Description |
---|---|
SegmentIntersector |
GeometryGraph.computeEdgeIntersections(GeometryGraph g,
LineIntersector li,
boolean includeProper) |
void |
EdgeEndStar.computeLabelling(GeometryGraph[] geomGraph) |
void |
DirectedEdgeStar.computeLabelling(GeometryGraph[] geom)
Compute the labelling for all dirEdges in this star, as well
as the overall labelling
|
private int |
EdgeEndStar.getLocation(int geomIndex,
Coordinate p,
GeometryGraph[] geom) |
boolean |
EdgeEndStar.isAreaLabelsConsistent(GeometryGraph geomGraph) |
Modifier and Type | Field and Description |
---|---|
protected GeometryGraph[] |
GeometryGraphOperation.arg
The operation args into an array so they can be accessed by index
|
Modifier and Type | Method and Description |
---|---|
private boolean |
IsSimpleOp.hasClosedEndpointIntersection(GeometryGraph graph)
Tests that no edge intersection is the endpoint of a closed line.
|
private boolean |
IsSimpleOp.hasNonEndpointIntersection(GeometryGraph graph)
For all edges, check if there are any intersections which are NOT at an endpoint.
|
Modifier and Type | Field and Description |
---|---|
private GeometryGraph[] |
RelateComputer.arg |
Modifier and Type | Method and Description |
---|---|
void |
RelateNodeGraph.build(GeometryGraph geomGraph) |
void |
RelateNodeGraph.computeIntersectionNodes(GeometryGraph geomGraph,
int argIndex)
Insert nodes for all intersections on the edges of a Geometry.
|
void |
RelateNodeGraph.copyNodesAndLabels(GeometryGraph geomGraph,
int argIndex)
Copy all nodes from an arg geometry into this graph.
|
Constructor and Description |
---|
RelateComputer(GeometryGraph[] arg) |
Modifier and Type | Field and Description |
---|---|
private GeometryGraph |
ConsistentAreaTester.geomGraph |
private GeometryGraph |
ConnectedInteriorTester.geomGraph |
private GeometryGraph |
IndexedNestedRingTester.graph |
Modifier and Type | Method and Description |
---|---|
private void |
IsValidOp.checkConnectedInteriors(GeometryGraph graph) |
private void |
IsValidOp.checkConsistentArea(GeometryGraph graph)
Checks that the arrangement of edges in a polygonal geometry graph
forms a consistent area.
|
private void |
IsValidOp.checkHolesInShell(Polygon p,
GeometryGraph graph)
Tests that each hole is inside the polygon shell.
|
private void |
IsValidOp.checkHolesNotNested(Polygon p,
GeometryGraph graph)
Tests that no hole is nested inside another hole.
|
private void |
IsValidOp.checkNoSelfIntersectingRings(GeometryGraph graph)
Check that there is no ring which self-intersects (except of course at its endpoints).
|
private Coordinate |
IsValidOp.checkShellInsideHole(LinearRing shell,
LinearRing hole,
GeometryGraph graph)
This routine checks to see if a shell is properly contained in a hole.
|
private void |
IsValidOp.checkShellNotNested(LinearRing shell,
Polygon p,
GeometryGraph graph)
Check if a shell is incorrectly nested within a polygon.
|
private void |
IsValidOp.checkShellsNotNested(MultiPolygon mp,
GeometryGraph graph)
Tests that no element polygon is wholly in the interior of another element polygon.
|
private void |
IsValidOp.checkTooFewPoints(GeometryGraph graph) |
static Coordinate |
IsValidOp.findPtNotNode(Coordinate[] testCoords,
LinearRing searchRing,
GeometryGraph graph)
Find a point from the list of testCoords
that is NOT a node in the edge for the list of searchCoords
|
Constructor and Description |
---|
ConnectedInteriorTester(GeometryGraph geomGraph) |
ConsistentAreaTester(GeometryGraph geomGraph)
Creates a new tester for consistent areas.
|
IndexedNestedRingTester(GeometryGraph graph) |