Orchid XP v7 <voi### [at] devnull> wrote:
> I want a data structure that stores key/value pairs where the keys are 
> points in 3D space. In particular, I want to be able to *efficiently* 
> look up the N points nearest to any given location.

http://en.wikipedia.org/wiki/Nearest_neighbor_search
http://en.wikipedia.org/wiki/R-tree
http://en.wikipedia.org/wiki/Kd_tree

-- 
                                                          - Warp

Post a reply to this message