Top
EdgeIntersectionList(Edge)
add(Coordinate, int, double): EdgeIntersection
iterator(): Iterator
isIntersection(Coordinate): boolean
addEndpoints(): void
addSplitEdges(List): void
print(PrintStream): void
Bottom
Source Classic

Class EdgeIntersectionList

Hierarchy: Object , EdgeIntersectionList
public class EdgeIntersectionList
A list of edge intersections along an Edge. Implements splitting an edge with intersections into multiple resultant edges.

Other

  • version: 1.7
public EdgeIntersectionList(Edge edge)
public EdgeIntersection add(Coordinate intPt, int segmentIndex, double dist)
Adds an intersection into the list, if it isn't already there. The input segmentIndex and dist are expected to be normalized.
Returns:
the EdgeIntersection found or added
public Iterator iterator()
Returns an iterator of EdgeIntersections
Returns:
an Iterator of EdgeIntersections
public boolean isIntersection(Coordinate pt)
Tests if the given point is an edge intersection
Parameters:
pt - pt the point to test
Returns:
true if the point is an intersection
public void addEndpoints()
Adds entries for the first and last points of the edge to the list
public void addSplitEdges(List edgeList)
Creates new edges for all the edges that the intersections in this list split the parent edge into. Adds the edges to the input list (this is so a single list can be used to accumulate all split edges for a Geometry).
Parameters:
edgeList - edgeList a list of EdgeIntersections
public void print(PrintStream out)