🏅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

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

2D polyline library for offsetting, combining, etc.

Templated hierarchical spatial trees designed for high-peformance.

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.

PH-Tree C++ implementation

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.

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

Flatbush for C++

Interactive UI development repository for the CavalierContours project

An Efficient Query Algorithm for Trajectory Similarity Based on MPI using the Fréchet Distance Threshold

HeaderOnly STL-like template N-dimensional R*Tree implementation on C++14

Implementation of R-tree in c++

[Mirrored from GitLab] KDB-Tree data structure implementation in C++

[Mirrored from Gitlab] Quad-Tree data structure implementation in c++

[Mirrored from GitLab] Waffle (Spatial Index) data structure implementation in C++.

Create indexes of simple shapes and find all indexed elements that intersect with a query region.

This repo contains the source code for our paper "LibRTS: A Spatial Indexing Library by Ray Tracing" published in PPoPP'25

ray tracing engine