A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion and removal. Uses templates.
Appears on
Quick read
Latest capture 2026-11-01 09:41
Compare the starting count and capture dates, not just the percentage. How to read GitHub star growth. Missing history is not zero growth.
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-11-01. 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
A pure Nim k-d tree implementation for efficient spatial querying of point data
High performance nearest neighbor data structures (KDTree and BallTree) and algorithms for Julia.
Fast radius neighbor search with an Octree (ICRA 2015)
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
A distributed approximate nearest neighborhood search (ANN) library which provides a high quality vector index build, search and distributed online serving toolkits for large scale vector search scenario.
