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

散乱点云数据的曲率精简算法
引用本文:周煜,张万兵,杜发荣,药晓江. 散乱点云数据的曲率精简算法[J]. 北京理工大学学报, 2010, 30(7): 785-789
作者姓名:周煜  张万兵  杜发荣  药晓江
作者单位:北京航空航天大学,交通科学与工程学院,北京,100191;一汽通用红塔云南汽车制造有限公司,云南,曲靖,655000
基金项目:国家"八六三"计划项目,云南省科技合作计划基金资助项目 
摘    要:针对海量散乱点云数据精简问题,提出了以平均曲率为判据的精简算法.采用八叉树结构对点云数据进行空间分割,由分割结果建立k邻域.在散乱数据点参数化的基础上,对k邻域内的散乱点进行二次曲面拟合,求出拟合曲面的平均曲率,进而得出邻域内所有数据点的平均曲率均值,以此为判据进行数据精简.构造曲率差函数,识别出边界数据点,对其进行数据保护.结果表明,该算法对具有曲率多样化特点的点云数据精简具有一定的理论意义和应用价值.通过实验验证了该算法的可靠性和准确性.

关 键 词:散乱点云  曲率  数据精简  边界数据保护
收稿时间:2009-05-17

Algorithm for Reduction of Scattered Point Cloud Data Based on Curvature
ZHOU Yu,ZHANG Wan-bing,DU Fa-rong and YAO Xiao-jiang. Algorithm for Reduction of Scattered Point Cloud Data Based on Curvature[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2010, 30(7): 785-789
Authors:ZHOU Yu  ZHANG Wan-bing  DU Fa-rong  YAO Xiao-jiang
Affiliation:ZHOU Yu1,ZHANG Wan-bing2,DU Fa-rong1,YAO Xiao-jiang1(1.School of Transportation Science , Engineering,Beihang University,Beijing 100191,China,2.Faw-GM Hongta Yunnan Automobile Co.Ltd,Qujing,Yunnan 655000,China)
Abstract:For reduction of scattered point cloud data,one algorithm based on mean curvature criterion is put forward.The space partition of point cloud is generated using octree structure.k neighborhood is constructed by partition result.All the points in k neighborhood are approximated by quadratic parametric surface based on scattered point cloud parameterization.The mean curvature of fitting surface is calculated.The judgment of requiring reduction is decided by the average of mean curvature.Boundary points are id...
Keywords:scattered point cloud  curvature  data reduction  boundary points protection  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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