RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
-
Updated
Jun 27, 2024 - JavaScript
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
🏅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.
A fast static index for 2D points
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
The fastest spatial index for geographic locations in JavaScript
Interactive details-on-demand data visualizations at scale
A dynamic, loose octree implementation written in C# as a .NET Standard 2.1 library
Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on the Hilbert Curve.
PH-Tree
GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Templated hierarchical spatial trees designed for high-peformance.
🌐 Search for nearby locations without DB usage.
Swift port of S2 Geometry.
RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates
RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids
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.
PH-Tree C++ implementation
Add a description, image, and links to the spatial-index topic page so that developers can more easily learn about it.
To associate your repository with the spatial-index topic, visit your repo's landing page and select "manage topics."