Package com.github.micycle1.geoblitz
package com.github.micycle1.geoblitz
-
ClassDescriptionComputes the union of circular disks by preserving circular arcs in the boundary representation instead of linearizing circles upfront.A boundary arc of the union, oriented so the union interior is on the left.Result: boundary as arc cycles (outer shells + holes).One closed boundary component: a cyclic list of arcs.Immutable disk definition used by this algorithm.Endpoint-only snapper with optional polygon-vertex anchoring.Computes the convex hull of a set of points using a fast monotone chain algorithm.Fast, pragmatic line segment intersection implementation optimized for speed.Identical to JTS'
VariableBufferbut usesHilbertParallelPolygonUnionunder the hood for faster unioning of buffer components.High-performance polygon union built on Hilbert-ordered batching and parallel reduction.HPRtreeX<T>Improves the original JTSHPRtreeimplementation with eXtended features: Generics support so the tree can store arbitrary user objects of typeT. 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 byHPRtreeX.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.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.ProHD: Projection-based Hausdorff Distance approximation for JTSGeometry.Approximate nearest-line-segment spatial index built from sample points taken along each segment and using the resulting Voronoi partition.A record containing the Voronoi cell polygon and its associated segment.Point-in-area locator for areal Geometries that uses per-polygon Y-stripe locators to test points efficiently.