kdtree-rs
kdtree-rs copied to clipboard
K-dimensional tree in Rust for fast geospatial indexing and lookup
Adds just a little bit of functionality to extract the top N items within a radius in an unsorted manner
I think that everything is ready to allow users to pass the maximum radius when searching for nearest points. Unfortunately rust does not support optional arguments yet, so something like...
Kind of this ``` let a = ([0f64, 0f64], 0); let b = ([1f64, 0f64], 1); let mut kdtree = KdTree::new(2); kdtree.add(a.0, a.1).unwrap(); kdtree.add(b.0, b.1).unwrap(); kdtree.remove(&[0f64, 0f64], &1).unwrap(); ``` or...
Adds a method to the KdTree that allows for querying points within a given bounding box. Very useful for geospatial applications such as map tilings.
I found that kdtree-rs can be used for development of robot localization algorithms on edge devices, so I made this crate compatible with no-std. The main modification was to replace...