#kd-tree #spatial #spatial-geometry

kdbush

A very fast static spatial index for 2D points based on a flat KD-tree

2 unstable releases

0.2.0 Apr 21, 2020
0.1.0 Jun 17, 2017

#12 in #spatial-geometry

Download history 156/week @ 2025-12-14 61/week @ 2025-12-21 51/week @ 2025-12-28 174/week @ 2026-01-04 196/week @ 2026-01-11 190/week @ 2026-01-18 127/week @ 2026-01-25 89/week @ 2026-02-01 78/week @ 2026-02-08 118/week @ 2026-02-15 105/week @ 2026-02-22 110/week @ 2026-03-01 196/week @ 2026-03-08 124/week @ 2026-03-15 102/week @ 2026-03-22 84/week @ 2026-03-29

514 downloads per month
Used in 5 crates

ISC license

15KB
317 lines

kdbush

Documentation

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

No runtime deps