| 基于栅格排序的散乱数据近邻快速搜索算法 |
| |
| 引用本文： | 李彬,常智勇,张力宁.基于栅格排序的散乱数据近邻快速搜索算法[J].价值工程,2011,30(16):10-12. |
| |
| 作者姓名： | 李彬 常智勇 张力宁 |
| |
| 作者单位： | 西北工业大学现代设计与集成制造技术教育部重点实验室,西安,710072 |
| |
| 基金项目： | 国家863高技术计划项目(2007AA04Z184)资助 |
| |
| 摘 要： | 文章提出了一种基于栅格排序的散乱数据近邻快速搜索算法。首先将散乱数据集进行空间栅格划分,然后求得当前被测点到周围栅格的距离并进行排序。按照栅格到被测点的距离,从小到大依次进行搜索,直到符合条件为止。实验结果表明,本算法可以大大缩小搜索范围,提高搜索速度。
|
| 关 键 词： | 近邻 空间划分 散乱点 |
An Algorithm for Searching K-Nearest Neighbors of Scattered Points Based Sorted Grids |
| |
| Li Bin,Chang Zhiyong,Zhang Lining.An Algorithm for Searching K-Nearest Neighbors of Scattered Points Based Sorted Grids[J].Value Engineering,2011,30(16):10-12. |
| |
| Authors: | Li Bin Chang Zhiyong Zhang Lining |
| |
| Institution: | Li Bin Chang Zhiyong Zhang Lining(Key Laboratory of Contemporary Design and Integrated Manufacturing Technology of Ministry of Education,Northwestern Polytechnical University,Xi'an 710072,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | K-nearest neighbors space division scattered points |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
