| java.lang.Object
 com.vividsolutions.jts.geomgraph.PlanarGraph
com.vividsolutions.jts.geomgraph.GeometryGraph
| GeometryGraph | | public class GeometryGraph extends PlanarGraph (Code) | | A GeometryGraph is a graph that models a given Geometry
version:
1.7 |
| GeometryGraph | | public GeometryGraph(int argIndex, Geometry parentGeom)(Code) | | |
| addEdge | | public void addEdge(Edge e)(Code) | | Add an Edge computed externally. The label on the Edge is assumed
to be correct.
|
| addPoint | | public void addPoint(Coordinate pt)(Code) | | Add a point computed externally. The point is assumed to be a
Point Geometry part, which has a location of INTERIOR.
|
| computeSelfNodes | | public SegmentIntersector computeSelfNodes(LineIntersector li, boolean computeRingSelfNodes)(Code) | | Compute self-nodes, taking advantage of the Geometry type to
minimize the number of intersection tests. (E.g. rings are
not tested for self-intersection, since they are assumed to be valid).
Parameters:
li - the LineIntersector to use
Parameters:
computeRingSelfNodes - if , intersection checks are optimized to not test rings for self-intersection the SegmentIntersector used, containing information about the intersections found |
| computeSplitEdges | | public void computeSplitEdges(List edgelist)(Code) | | |
| determineBoundary | | public static int determineBoundary(BoundaryNodeRule boundaryNodeRule, int boundaryCount)(Code) | | This method implements the Boundary Determination Rule
for determining whether
a component (node or edge) that appears multiple times in elements
of a MultiGeometry is in the boundary or the interior of the Geometry
The SFS uses the "Mod-2 Rule", which this function implements
An alternative (and possibly more intuitive) rule would be
the "At Most One Rule":
isInBoundary = (componentCount == 1)
|
| hasTooFewPoints | | public boolean hasTooFewPoints()(Code) | | This constructor is used by clients that wish to add Edges explicitly,
rather than adding a Geometry. (An example is BufferOp).
|
|
|