Open Robdr opened 12 years ago
Any news on this? Or hints on how to implement it? Would be nice to give it a try.
The algorithm is nicely described here for 2 dimensions: http://www.cs.utah.edu/~lifeifei/cs6931/kdtree.pdf
You'd need to extend it to work for any number of dimensions, though. It's not really that hard, if you look at how insertion, deletion and retrieval were extended.
Did anyone implement the range search ?
Un fortunately I didn't have the time to work on it. Anyone else interested in working on it?
As I needed range searches, I wrote my own implementation today, plugging it here: https://github.com/benmaier/kd-tree-js
it would be great if next to nearest neighbor searches range searches are supported.