Class MonotoneChainEdge
java.lang.Object
org.locationtech.jts.geomgraph.index.MonotoneChainEdge
MonotoneChains are a way of partitioning the segments of an edge to
allow for fast searching of intersections.
They have the following properties:
- the segments within a monotone chain will never intersect each other
- the envelope of any contiguous subset of the segments in a monotone chain is simply the envelope of the endpoints of the subset.
- Version:
- 1.7
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoid
void
computeIntersectsForChain
(int chainIndex0, MonotoneChainEdge mce, int chainIndex1, SegmentIntersector si) double
getMaxX
(int chainIndex) double
getMinX
(int chainIndex) int[]
-
Constructor Details
-
MonotoneChainEdge
-
-
Method Details
-
getCoordinates
-
getStartIndexes
public int[] getStartIndexes() -
getMinX
public double getMinX(int chainIndex) -
getMaxX
public double getMaxX(int chainIndex) -
computeIntersects
-
computeIntersectsForChain
public void computeIntersectsForChain(int chainIndex0, MonotoneChainEdge mce, int chainIndex1, SegmentIntersector si)
-