| 一种改进的散乱数据点的k近邻快速搜索算法 |
| |
| 引用本文： | 马长胜,姜晓峰,强鹤群.一种改进的散乱数据点的k近邻快速搜索算法[J].苏州大学学报(工科版),2007,27(2):47-50. |
| |
| 作者姓名： | 马长胜 姜晓峰 强鹤群 |
| |
| 作者单位： | 苏州大学计算机科学与技术学院,江苏,苏州,215006 |
| |
| 摘 要： | 提出了一种基于二次分割的自适应最小包围盒的栅格化策略，提高了散乱数据点k近邻搜索算法的速度。采用传统分块算法对点云空间进行首次分割，在此基础上估算点云平均点距，并利用平均点距估算结果对点云数据空间重新进行划分。分块结果使得k近邻搜索算法的搜索范围大大缩小，搜索速度明显提高。
|
| 关 键 词： | 点云 k近邻 空间划分 |
| 文章编号： | 1673-047X（2007）02-0047-04 |
| 收稿时间： | 2006-11-09 |
| 修稿时间： | 2006-11-09 |
An Improved Algorithm for Searching K-Nearest Neighbors of Scattered-Point Cloud Data |
| |
| MA Chang-sheng,JIANG Xiao-feng,QIANG He-qun.An Improved Algorithm for Searching K-Nearest Neighbors of Scattered-Point Cloud Data[J].Journal of Suzhou University(Engineering Science Edition),2007,27(2):47-50. |
| |
| Authors: | MA Chang-sheng JIANG Xiao-feng QIANG He-qun |
| |
| Affiliation: | College of Computer Science and Technology, Suzhou University, Suzhou 215006, China |
| |
| Abstract: | An adaptive min-max box division strategy based on secondary division is presented,the speed for searching points'k nearest neighbor in improved.The min-max box of the point cloud is first divided into a set of uniform grids by traditional algorithm,and the average distance of point is estimated base on the first division result,then the cloud space is divided again using the average distance.The division result makes the range to be searched much small and the searching speed much faster. |
| |
| Keywords: | point cloud K nearest neighbors space division |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
