[英]approaches to nearest neighbor searching [closed]
在二维中最邻近搜索应使用哪种数据结构?
我搜索并发现有许多数据结构:kd树,四叉树,八叉树。 那么我应该使用哪种结构?
我建议使用R-Tree ,它就是为此目的而设计的。
[英]Storing nearest neighbor
[英]Nearest neighbor zones visualized
[英]Nearest neighbor algorithm
[英]Nearest neighbor search in Octree
[英]K nearest neighbor pseudocode?
[英]K Nearest Neighbor Questions
[英]neighbor searching algorithm
[英]2D Nearest Neighbor Search
[英]Algorithm for Octree for nearest neighbor search
[英]Nearest neighbor and pattern recognition with Haskell
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.