There are 8 repositories under spatial-index topic.
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
2D polyline library for offsetting, combining, etc.
Interactive details-on-demand data visualizations at scale
RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates
Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on the Hilbert Curve.
:globe_with_meridians: Search for nearby locations without DB usage.
GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
An elixir implementation of Rtree, optimized for fast updates.
Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R* balancing algorithms as well as bulk loading.
Fast static 2D axis aligned bounding box index
PH-Tree C++ implementation
Generic RTree for Nim
Spatial indexing algorithms for java
Swift port of S2 Geometry.
An R Interface to H3 via V8 and h3-js
A library for spatially indexing kD bounding box data (based on libspatialindex)
An Efficient Query Algorithm for Trajectory Similarity Based on MPI using the Fréchet Distance Threshold