A pure Nim k-d tree implementation for efficient spatial querying of point data
Appears on
Quick read
Latest capture 2026-10-16 10:03
Archive status reflects the last catalog sync, not a maintenance assessment. Check recent releases, issue responses, and fit for your project with the repository shortlisting checklist.
0 paths
Agent instructions and tool configuration found in this repository.
No config files detected.
1 observed capture since 2026-10-16. Observed captures are shown by default.
Stars from first capture 0
Observed captures only
All tracked data
Observed snapshots
Observed snapshots
Nearest indexed repositories by embedding similarity.
K-dimensional tree in Rust for fast geospatial indexing and lookup
High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
A library for spatially indexing kD bounding box data (based on libspatialindex)
A Rust port of kdbush, a fast static spatial index for 2D points.
simple, immutable, flat k-d tree
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
