Top
EdgeRing(DirectedEdge, GeometryFactory)
isIsolated(): boolean
isHole(): boolean
getCoordinate(int): Coordinate
getLinearRing(): LinearRing
getLabel(): Label
isShell(): boolean
getShell(): EdgeRing
setShell(EdgeRing): void
addHole(EdgeRing): void
toPolygon(GeometryFactory): Polygon
computeRing(): void
getNext(DirectedEdge): DirectedEdge
setEdgeRing(DirectedEdge, EdgeRing): void
getEdges(): List
computePoints(DirectedEdge): void
getMaxNodeDegree(): int
setInResult(): void
mergeLabel(Label): void
mergeLabel(Label, int): void
addPoints(Edge, boolean, boolean): void
containsPoint(Coordinate): boolean
Bottom
Source Classic

Class EdgeRing

Hierarchy: Object , EdgeRing
Direct Known Subclasses: MinimalEdgeRing, MaximalEdgeRing
public abstract class EdgeRing

Other

  • version: 1.7
public EdgeRing(DirectedEdge start, GeometryFactory geometryFactory)
public boolean isIsolated()
public boolean isHole()
public Coordinate getCoordinate(int i)
public LinearRing getLinearRing()
public Label getLabel()
public boolean isShell()
public EdgeRing getShell()
public void setShell(EdgeRing shell)
public void addHole(EdgeRing ring)
public Polygon toPolygon(GeometryFactory geometryFactory)
public void computeRing()
Compute a LinearRing from the point list previously collected. Test if the ring is a hole (i.e. if it is CCW) and set the hole flag accordingly.
public abstract abstract DirectedEdge getNext(DirectedEdge de)
public abstract abstract void setEdgeRing(DirectedEdge de, EdgeRing er)
public List getEdges()
Returns the list of DirectedEdges that make up this EdgeRing
protected void computePoints(DirectedEdge start)
Collect all the points from the DirectedEdges of this ring into a contiguous list
public int getMaxNodeDegree()
public void setInResult()
protected void mergeLabel(Label deLabel)
protected void mergeLabel(Label deLabel, int geomIndex)
Merge the RHS label from a DirectedEdge into the label for this EdgeRing. The DirectedEdge label may be null. This is acceptable - it results from a node which is NOT an intersection node between the Geometries (e.g. the end node of a LinearRing). In this case the DirectedEdge label does not contribute any information to the overall labelling, and is simply skipped.
protected void addPoints(Edge edge, boolean isForward, boolean isFirstEdge)
public boolean containsPoint(Coordinate p)
This method will cause the ring to be computed. It will also check any holes, if they have been assigned.