RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles

A very fast static spatial index for 2D points and rectangles in JavaScript 🌱

🏅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

A fast static index for 2D points

Boost.Geometry - Generic Geometry Library | Requires C 14 since Boost 1.75

2D polyline library for offsetting, combining, etc.

The fastest spatial index for geographic locations in JavaScript

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

A dynamic, loose octree implementation written in C# as a .NET Standard 2.1 library

Templated hierarchical spatial trees designed for high-peformance.

PH-Tree

R-Tree Implementation for C#

Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on the Hilbert Curve.

RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids

🌐 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

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.

Zinc is a C library for spatial processing.

An elixir implementation of Rtree, optimized for fast updates.