100+ algorithms & data structures generically implemented in C#

an R-Tree library for Go

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

Templated hierarchical spatial trees designed for high-peformance.

Python library for optimized interpolation.

A Rust crate and Python library for packed, static, zero-copy spatial indexes.

A Julia package for downloading and analysing geospatial data from OpenStreetMap APIs.

An elixir implementation of Rtree, optimized for fast updates.

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.

Implement rtree range queries and nearest neighbour queries

N-dimensional RTree implementation in C

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

super minimal geofencing application

Implementations of Binary Space Parititoning and Sort Tile Recursive Partitioning algorithm.

Java Implementation of the R* Tree

a spatial index for neo4j 4.x

Actively maintained on https://gitlab.com/mdds/mdds instead. This one is just a mirror.

Keep people off your lawn with claims! Built for Fabric.

Data Structure: RTree - core, allow to handle Polygons in 2D.