k-dimensional tree
A Rust implementation of a k-d tree.
Very generic containers including KD trees, fibonacci heaps, minmax heaps, ...
Deterministic manifold snapping with O(log n) KD-tree indexing — maps continuous vectors to exact Pythagorean coordinates
Spatial search trees with a focus on online mutability, speed, performance guarantees, and flexibility
Neighbor-based algorithms for sklears: k-NN, radius neighbors
High-performance spatial index for radius queries in D-dimensional Euclidean space
A very fast static spatial index for 2D points based on a flat KD-tree.
A very fast static spatial index for 2D points based on a flat KD-tree.
Fast, Dependency-free Spacial Queries
K-dimensional tree space-partitioning data structure
FNNTW: Fastest Nearest Neighbor (in the) West. A fast kdtree/kNN library.
A simple Ruby implementation of a k-d tree.
Great for nearest neighbor search in k dimensions! (as long as k is reasonable)
A KDTree Library
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.