|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.geotools.geometry.iso.topograph2D.PlanarGraph
org.geotools.geometry.iso.topograph2D.GeometryGraph
public class GeometryGraph
A GeometryGraph is a graph that models a given Geometry
Field Summary |
---|
Fields inherited from class org.geotools.geometry.iso.topograph2D.PlanarGraph |
---|
cga, edgeEndList, edges, nodes |
Constructor Summary | |
---|---|
GeometryGraph(int argIndex,
GeometryImpl parentGeom)
|
Method Summary | |
---|---|
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(java.util.List edgelist)
|
static int |
determineBoundary(int boundaryCount)
|
Edge |
findEdge(CurveImpl line)
|
java.util.Collection |
getBoundaryNodes()
|
Coordinate[] |
getBoundaryPoints()
|
GeometryImpl |
getGeometry()
|
Coordinate |
getInvalidPoint()
|
boolean |
hasTooFewPoints()
|
static boolean |
isInBoundary(int boundaryCount)
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) |
Methods inherited from class org.geotools.geometry.iso.topograph2D.PlanarGraph |
---|
add, addEdges, addNode, addNode, find, findEdge, findEdgeEnd, findEdgeInSameDirection, getEdgeEnds, getEdgeIterator, getNodeIterator, getNodes, insertEdge, isBoundaryNode, linkAllDirectedEdges, linkResultDirectedEdges, linkResultDirectedEdges, printEdges |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public GeometryGraph(int argIndex, GeometryImpl parentGeom)
Method Detail |
---|
public static boolean isInBoundary(int boundaryCount)
public static int determineBoundary(int boundaryCount)
public boolean hasTooFewPoints()
public Coordinate getInvalidPoint()
public GeometryImpl getGeometry()
public java.util.Collection getBoundaryNodes()
public Coordinate[] getBoundaryPoints()
public Edge findEdge(CurveImpl line)
public void computeSplitEdges(java.util.List edgelist)
public void addEdge(Edge e)
public void addPoint(Coordinate pt)
public SegmentIntersector computeSelfNodes(LineIntersector li, boolean computeRingSelfNodes)
li
- the LineIntersector to usecomputeRingSelfNodes
- if public SegmentIntersector computeEdgeIntersections(GeometryGraph g, LineIntersector li, boolean includeProper)
g
- li
- includeProper
-
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |