MonotoneChainIndexer class
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
Constructors
Properties
- hashCode → int
-
The hash code for this object.
no setterinherited
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
findChainEnd(
List< Coordinate> pts, int start) → int - @return the index of the last point in the monotone chain
-
getChainStartIndices(
List< Coordinate> pts) → List<int> -
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
OLDgetChainStartIndices(
List< Coordinate> pts) → List<int> -
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited
Static Methods
-
toIntArray(
List list) → List< int>