Вопрос

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