| com.vividsolutions.jts.index.chain |
|
Contains classes that implement Monotone Chains
|
| Java Source File Name | Type | Comment |
| MonotoneChain.java | Class | MonotoneChains are a way of partitioning the segments of a linestring 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 equal to the envelope of the endpoints of the subset.
Property 1 means that there is no need to test pairs of segments from within
the same monotone chain for intersection.
Property 2 allows
binary search to be used to find the intersection points of two monotone chains.
For many types of real-world data, these properties eliminate a large number of
segment comparisons, producing substantial speed gains.
One of the goals of this implementation of MonotoneChains is to be
as space and time efficient as possible. |
| MonotoneChainBuilder.java | Class | A MonotoneChainBuilder implements functions to determine the monotone chains
in a sequence of points. |
| MonotoneChainOverlapAction.java | Class | |
| MonotoneChainSelectAction.java | Class | |