2 unstable releases
| 0.2.0 | Apr 21, 2020 |
|---|---|
| 0.1.0 | Jun 17, 2017 |
#1878 in Algorithms
440 downloads per month
Used in 5 crates
15KB
317 lines
kdbush
A Rust port of kdbush, a very fast static spatial index for 2D points based on a flat KD-tree.
Introduction: A dive into spatial search algorithms
Comparison of point and box spatial index libraries.
Usage
let points = vec![(54.0, 1.0), (97.0, 21.0), (65.0, 35.0)];
let index = KDBush::create(points, kdbush::DEFAULT_NODE_SIZE); // make an index
index.range(20.0, 30.0, 50.0, 70.0, |id| print!("{} ", id)); // bbox search - minX, minY, maxX, maxY
index.within(50.0, 50.0, 20.0, |id| print!("{} ", id)); // radius search - x, y, radius