Class MonotoneChainEdge
- java.lang.Object
-
- org.locationtech.jts.geomgraph.index.MonotoneChainEdge
-
public class MonotoneChainEdge extends java.lang.Object
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 Constructor Description MonotoneChainEdge(Edge e)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
computeIntersects(MonotoneChainEdge mce, SegmentIntersector si)
void
computeIntersectsForChain(int chainIndex0, MonotoneChainEdge mce, int chainIndex1, SegmentIntersector si)
Coordinate[]
getCoordinates()
double
getMaxX(int chainIndex)
double
getMinX(int chainIndex)
int[]
getStartIndexes()
-
-
-
Constructor Detail
-
MonotoneChainEdge
public MonotoneChainEdge(Edge e)
-
-
Method Detail
-
getCoordinates
public Coordinate[] getCoordinates()
-
getStartIndexes
public int[] getStartIndexes()
-
getMinX
public double getMinX(int chainIndex)
-
getMaxX
public double getMaxX(int chainIndex)
-
computeIntersects
public void computeIntersects(MonotoneChainEdge mce, SegmentIntersector si)
-
computeIntersectsForChain
public void computeIntersectsForChain(int chainIndex0, MonotoneChainEdge mce, int chainIndex1, SegmentIntersector si)
-
-