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

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

R-Tree Implementation for C#

RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates

PH-Tree

Templated hierarchical spatial trees designed for high-peformance.

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

AISdb Python package for smart AIS data storage and itegration.

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.

Fast static 2D axis aligned bounding box index

The fastest Quadtree for Python. Just pip install and go. Quick inserts, easy neighbor queries, and seamless Pygame support.

Library for the GPU-accelerated spatial indexing and processing of particles in 2D and 3D with OpenCL. Currently offers trees based on space-filling-curves.

Generic RTree for Nim

ST-Hadoop is an open-source MapReduce extension of Hadoop designed specially to analyze your spatio-temporal data efficiently

A C++ implementation of the Quad-Tree spatial index.

Flatbush for C++

Spatial indexing algorithms for java

A d-dimensional aabb-tree implementation for MATLAB.

Swift port of S2 Geometry.