有效实施最近邻居搜索 [英] Efficient implementation of the Nearest Neighbour Search

问题描述

我正在尝试为最近邻居搜索问题实现一种有效的算法.

I am trying to implement an efficient algorithm for nearest-neighbour search problem.

我已经阅读了有关某些数据结构的教程，这些数据结构支持针对此类问题的操作(例如， R-tree ， cover tree 等)，但是所有这些都难以实施.

I have read tutorials about some data structures, which support operations for this kind of problems (for example, R-tree, cover tree, etc.), but all of them are difficult to implement.

我也找不到这些数据结构的样本源代码.我知道C ++，并且正在尝试使用这种语言解决此问题.

Also I cannot find sample source code for these data structures. I know C++ and I am trying to solve this problem in this language.

理想情况下，我需要描述如何使用源代码实现这些数据结构的链接.

Ideally, I need links that describe how to implement these data structures using source code.

推荐答案

您可以尝试使用线扫算法来找到最接近的点对:

You could try a linesweep algorithm to find the closest pair of points: http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lineSweep.

这篇关于有效实施最近邻居搜索的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！