100+ algorithms & data structures generically implemented in C#
an R-Tree library for Go
A Rust crate and Python library for packed, immutable, zero-copy spatial indexes.
RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates
Python library for optimized interpolation.
Templated hierarchical spatial trees designed for high-peformance.
A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.
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.
An elixir implementation of Rtree, optimized for fast updates.
Implement rtree range queries and nearest neighbour queries
A Python implementation of Priority R-Tree, an alternative to RTree.
Hybrid Spatial Data Structure based on Quad Tree, R Tree and KD Tree for insertion, search and finding the nearest neighbours on a 2D plane
Java Implementation of the R* Tree
Implementations of Binary Space Parititoning and Sort Tile Recursive Partitioning algorithm.
A collection of space partitioning trees for Rust 🦀
HeaderOnly STL-like template N-dimensional R*Tree implementation on C++14
Understanding a fast, elegant RTree implementation.
Add a description, image, and links to the rtree topic page so that developers can more easily learn about it.
To associate your repository with the rtree topic, visit your repo's landing page and select "manage topics."