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?

有帮助吗?

解决方案

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

许可以下: CC-BY-SA归因
不隶属于 StackOverflow
scroll top