基于栅格排序的散乱数据近邻快速搜索算法

摘要

文章提出了一种基于栅格排序的散乱数据近邻快速搜索算法.首先将散乱数据集进行空间栅格划分,然后求得当前被测点到周围栅格的距离并进行排序.按照栅格到被测点的距离,从小到大依次进行搜索,直到符合条件为止.实验结果表明,本算法可以大大缩小搜索范围,提高搜索速度.%An algorithm for searching K-Nearest Neighbors of scattered points based sorted grids is presented.At first, the scattered points are divided into a set of uniform grids, and then sorted the distances between the current point and the grids around it.Searching the grids accord to the distances from small to large until meeting the requirements.Experiments show that the algorithm makes the searching range to be much smaller and the searching speed to be much faster.