All Classes and Interfaces
Class
Description
Endpoint-only snapper with optional polygon-vertex anchoring.
Fast, pragmatic line segment intersection implementation optimized for speed.
Identical to JTS'
VariableBuffer but uses
HilbertParallelPolygonUnion under the hood for faster unioning of buffer
components.High-performance polygon union built on Hilbert-ordered batching and parallel
reduction.
Improves the original JTS HPRTree implementation with eXtended features:
Generics support so the tree can store arbitrary user objects of type
T.
Support for an early-exit item visitor to terminate spatial
queries as soon as a condition is satisfied.
Efficient nearest-neighbor search using a best-first traversal with
bounding-box pruning.
Efficient range query search.
Functional interface used to compute the distance between a query coordinate
and an item stored in the tree.
Visitor interface used by
HPRtreeX.query(Envelope, ItemVisitor) to process
items that intersect a query envelope.IndexedLengthIndexedLine provides length-based linear-referencing using a
prebuilt cumulative-length index so that length→location queries are answered
in O(log n) time.
Approximate nearest-line-segment spatial index built from sample points taken
along each segment and using the resulting Voronoi partition.
Point-in-area locator for areal Geometries that uses per-polygon Y-stripe
locators to test points efficiently.