Question

What kind of data structure should be used for nearest neighbor searching in 2d dimension?

I have searched and found out that there are many data structures for this: k-d tree, quadtree, octree. So what kind of structure should I use?

Was it helpful?

Solution

I suggest a R-Tree, it's designed for that purpose.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top