首页 | 本学科首页   官方微博 | 高级检索  
     检索      

三维散乱点云的Voronoi拓扑近邻点集查询算法
引用本文:孙殿柱,刘健,李延瑞,孙永伟.三维散乱点云的Voronoi拓扑近邻点集查询算法[J].武汉大学学报(信息科学版),2011(1):86-91.
作者姓名:孙殿柱  刘健  李延瑞  孙永伟
作者单位:山东理工大学机械工程学院;
基金项目:国家863计划资助项目(2006AA04Z105)
摘    要:提出一种三维散乱点云的Voronoi拓扑近邻点集查询算法,该算法改进R*-tree建立三维散乱点云的空间索引结构,采用动态扩展空心球算法获取样点的k近邻点集,通过偏心扩展和自适应扩展获取样点拓扑近邻参考数据,生成该局部点集的Voronoi图,查询样点Voronoi邻域获取样点拓扑近邻点集。通过算法时间复杂度分析及相关实验,证明该算法可快速、准确地获取任意复杂散乱点云的Voronoi拓扑近邻点集。

关 键 词:三维散乱点云  空间索引结构  偏心扩展  自适应扩展  Voronoi拓扑近邻

An Algorithm Inquiring Voronoi Topological Neighbors for 3D Scattered Point-cloud
SUN Dianzhu LIU Jian LI Yanrui SUN Yongwei.An Algorithm Inquiring Voronoi Topological Neighbors for 3D Scattered Point-cloud[J].Geomatics and Information Science of Wuhan University,2011(1):86-91.
Authors:SUN Dianzhu LIU Jian LI Yanrui SUN Yongwei
Institution:SUN Dianzhu1 LIU Jian1 LI Yanrui1 SUN Yongwei1 (1 School of Mechanical Engineering,Shandong University of Technology,12 Zhangzhou Road,Zibo 255091,China)
Abstract:An algorithm inquiring topological neighbors for 3d scattered point-cloud based on the Voronoi Diagram of local point-set is proposed,which has four steps: first,R*-tree was applied and improved to organize the spatial indexing structure of scattered point-cloud;second,the neighboring points set of the sampling point was gain according to the algorithm searching for k-nearest neighbors;third,the topological neighbors reference data of the sampling point were obtained through eccentric and adaptive expansion...
Keywords:3D scattered point-cloud  spatial indexing structure  eccentric expansion  adaptive expansion  Voronoi topological neighbors  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号