All Classes and Interfaces

Class	Description
DiskUnion	Computes the union of circular disks by preserving circular arcs in the boundary representation instead of linearizing circles upfront.
DiskUnion.Arc	A boundary arc of the union, oriented so the union interior is on the left.
DiskUnion.ArcBoundary	Result: boundary as arc cycles (outer shells + holes).
DiskUnion.ArcCycle	One closed boundary component: a cyclic list of arcs.
DiskUnion.Disk	Immutable disk definition used by this algorithm.
EndpointSnapper	Endpoint-only snapper with optional polygon-vertex anchoring.
FastConvexHull	Computes the convex hull of a set of points using a fast monotone chain algorithm.
FastLineIntersector	Fast, pragmatic line segment intersection implementation optimized for speed.
FastVariableBuffer	Identical to JTS' VariableBuffer but uses HilbertParallelPolygonUnion under the hood for faster unioning of buffer components.
HilbertParallelPolygonUnion	High-performance polygon union built on Hilbert-ordered batching and parallel reduction.
HPRtreeX<T>	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.
HPRtreeX.DistanceToItem<T>	Functional interface used to compute the distance between a query coordinate and an item stored in the tree.
HPRtreeX.ItemVisitor<T>	Visitor interface used by HPRtreeX.query(Envelope, ItemVisitor) to process items that intersect a query envelope.
IndexedLengthIndexedLine	IndexedLengthIndexedLine provides length-based linear-referencing using a prebuilt cumulative-length index so that length→location queries are answered in O(log n) time.
PointDistanceIndex	Computes distances from query points (Coordinates) to the nearest indexed distance target extracted from one or two input geometries, using a spatial index for fast repeated queries.
ProHausdorffDistance	ProHD: Projection-based Hausdorff Distance approximation for JTS Geometry.
SegmentVoronoiIndex	Approximate nearest-line-segment spatial index built from sample points taken along each segment and using the resulting Voronoi partition.
SegmentVoronoiIndex.CellRecord	A record containing the Voronoi cell polygon and its associated segment.
YStripesPointInAreaLocator	Point-in-area locator for areal Geometries that uses per-polygon Y-stripe locators to test points efficiently.