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 collection of space partitioning trees for Rust 🦀 with Python bindings 🐍
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.
A Python implementation of Priority R-Tree, an alternative to RTree.
A portable and efficient library of spatial indexes in C++ including R-tree, Quad-Tree, and KD-Tree variants.
Implement rtree range queries and nearest neighbour queries
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
Implementations of Binary Space Parititoning and Sort Tile Recursive Partitioning algorithm.
Java Implementation of the R* Tree
HeaderOnly STL-like template N-dimensional R*Tree implementation on C++14
Secure Database MCP Server featuring a V8 Isolate Code Mode sandbox that unifies 181+ tools, delivering 70-90% token savings. Built for enterprise with HTTP/SSE transports, OAuth 2.1, dynamic filtering, granular RBAC, audit logging, deterministic error handling, Prometheus metrics, and encryption at rest for maximum observability and safety.
To associate your repository with the rtree topic, visit your repo's landing page and select "manage topics."