public class GeometryGraph extends PlanarGraph
Constructor and Description |
---|
GeometryGraph(int argIndex,
Geometry parentGeom) |
GeometryGraph(int argIndex,
Geometry parentGeom,
BoundaryNodeRule boundaryNodeRule) |
Modifier and Type | Method and Description |
---|---|
void |
addEdge(Edge e)
Add an Edge computed externally.
|
void |
addPoint(Coordinate pt)
Add a point computed externally.
|
SegmentIntersector |
computeEdgeIntersections(GeometryGraph g,
LineIntersector li,
boolean includeProper) |
SegmentIntersector |
computeSelfNodes(LineIntersector li,
boolean computeRingSelfNodes)
Compute self-nodes, taking advantage of the Geometry type to
minimize the number of intersection tests.
|
void |
computeSplitEdges(List edgelist) |
static int |
determineBoundary(BoundaryNodeRule boundaryNodeRule,
int boundaryCount)
Determine boundary
|
Edge |
findEdge(LineString line) |
BoundaryNodeRule |
getBoundaryNodeRule() |
Collection |
getBoundaryNodes() |
Coordinate[] |
getBoundaryPoints() |
Geometry |
getGeometry() |
Coordinate |
getInvalidPoint() |
boolean |
hasTooFewPoints() |
int |
locate(Coordinate pt)
Determines the
Location of the given Coordinate
in this geometry. |
add, addEdges, addNode, addNode, find, findEdge, findEdgeEnd, findEdgeInSameDirection, getEdgeEnds, getEdgeIterator, getNodeIterator, getNodes, isBoundaryNode, linkAllDirectedEdges, linkResultDirectedEdges, linkResultDirectedEdges, printEdges
public GeometryGraph(int argIndex, Geometry parentGeom)
public GeometryGraph(int argIndex, Geometry parentGeom, BoundaryNodeRule boundaryNodeRule)
public static int determineBoundary(BoundaryNodeRule boundaryNodeRule, int boundaryCount)
boundaryNodeRule
- Boundary node ruleboundaryCount
- the number of component boundaries that this point occurs inpublic boolean hasTooFewPoints()
public Coordinate getInvalidPoint()
public Geometry getGeometry()
public BoundaryNodeRule getBoundaryNodeRule()
public Collection getBoundaryNodes()
public Coordinate[] getBoundaryPoints()
public Edge findEdge(LineString line)
public void computeSplitEdges(List edgelist)
public void addEdge(Edge e)
e
- Edgepublic void addPoint(Coordinate pt)
pt
- Coordinatepublic SegmentIntersector computeSelfNodes(LineIntersector li, boolean computeRingSelfNodes)
li
- the LineIntersector to usecomputeRingSelfNodes
- if false
, intersection checks are optimized to not test rings for self-intersectionpublic SegmentIntersector computeEdgeIntersections(GeometryGraph g, LineIntersector li, boolean includeProper)
public int locate(Coordinate pt)
Location
of the given Coordinate
in this geometry.pt
- the point to testCopyright © 2024. All rights reserved.