Class MonotoneChainIndexer
java.lang.Object
org.locationtech.jts.geomgraph.index.MonotoneChainIndexer
MonotoneChains are a way of partitioning the segments of an edge to
allow for fast searching of intersections.
Specifically, a sequence of contiguous line segments
is a monotone chain iff all the vectors defined by the oriented segments
lies in the same quadrant.
Monotone Chains have the following useful 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.
Note that due to the efficient intersection test, there is no need to limit the size of chains to obtain fast performance.
- Version:
- 1.7
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprivate int
findChainEnd
(Coordinate[] pts, int start) int[]
getChainStartIndices
(Coordinate[] pts) static int[]
toIntArray
(List list)
-
Constructor Details
-
MonotoneChainIndexer
public MonotoneChainIndexer()
-
-
Method Details
-
toIntArray
-
getChainStartIndices
-
findChainEnd
- Returns:
- the index of the last point in the monotone chain
-