RTree2D

Uses Sort-Tile-Recursive packing to create balanced trees, delivering ultra-fast query performance even with millions of overlapping entries, as benchmarked against alternatives like Archery and JTS.

Optimized memory layout and access patterns for modern CPU caches, enabling thread-safe concurrent reads without locking, ideal for real-time applications with high throughput.

Supports both Euclidean plane and spherical Earth coordinates with ±1 meter precision for lat/lon and ±0.3% distance accuracy using the Haversine formula, per the README's accuracy claims.

Efficient implementations reduce allocations and virtual calls, minimizing garbage collection impact—key for large-scale data pipelines, as emphasized in the goals section.