문제

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