Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
-
Updated
Oct 9, 2024 - C++
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.
Templated hierarchical spatial trees designed for high-peformance.
PH-Tree C++ implementation
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.
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.
An Efficient Query Algorithm for Trajectory Similarity Based on MPI using the Fréchet Distance Threshold
Interactive UI development repository for the CavalierContours project
A C++ implementation of the Quad-Tree spatial index.
Create indexes of simple shapes and find all indexed elements that intersect with a query region.
Rtree building and query processing
🌳 kd-tree for indexing and searching spatial points
[Mirrored from GitLab] KDB-Tree data structure implementation in C++
Python wrapper for Boost Geometry Rtree
[Mirrored from Gitlab] Quad-Tree data structure implementation in c++
Flatbush for C++
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."