期刊文献+

空间分割与曲率相融合的点云精简算法研究 被引量:12

Study of point cloud data reduction algorithm integrating space partition and curvature
在线阅读 下载PDF
导出
摘要 非接触式扫描方法获得点云数据存在大量的冗余数据。为便于模型重构,针对点云数据精简是必不可少的数据预处理手段,提出了一种基于空间分割和曲率特征信息的点云数据精简算法。通过K-邻域计算、二次曲面拟合、曲率估算和曲率阈值可调的数据分区等关键精简技术,实现了对同一数据不同区域应用不同精简算法,进行不同比例的数据精简。实例验证表明,该算法能适应各种类型曲面数据的精简要求,保证精简效率的同时,很好地保留点云的特征信息。 There are huge amounts of redundant data in point cloud data obtained by non-contact scanning.In order to realize model reconstruction effectively,point cloud data reduction is an indispensable means of pre-processing means.This paper presented an approach of point cloud data reduction based on space partition and curvature.Through some key technologies,such as K-neighborhood search,second surface fitting,curvature estimation,and data partition by of controllable curvature threshold,it applied the different reduction algorithms in different regions of the same point cloud data,meanwhile,achieved realizable reduction proportions.So,the algorithm can ensure reduction efficiency and retain characteristic information of the point cloud data simultaneously.
出处 《计算机应用研究》 CSCD 北大核心 2012年第5期1997-2000,共4页 Application Research of Computers
基金 中央高校基本科研业务费专项资金资助(SWJTU09ZT06)
关键词 K-邻域 曲率 空间分割 最小距离 包围盒 K-neighbors curvature space partition minimum distance bounding box
  • 相关文献

参考文献9

  • 1SUN W,BRADLEY C,Zhang Y F,et al.Cloud data modeling emplo-ying a unified non-redundant triangular mesh[J].Computer AidedDesign,2001,33(2):183-193.
  • 2MARTIN R R,STROUD I A,MARSHAL A D.Data reduction for re-verse engineering,No.1068[R].[S.l.]:Computer and AutomationInstitute of Hungarian Academy of Science,1996:63-69.
  • 3CHEN Y H,NG C T,WANG Y Z.Data reductionin integrated re-verse engineering and rapid prototyping[J].International Journal ofComputer Integrated Manufacuring,1999,12(2):97-103.
  • 4刘德平,陈建军.逆向工程中数据精简技术的研究[J].西安电子科技大学学报,2008,35(2):334-339. 被引量:21
  • 5LEE K H,WOO H,SUK T.Point data reduction using 3D grids[J].The International Journal of Advanced Manufacturing Technolo-gy,2001,18(3):201-210.
  • 6周煜,张万兵,杜发荣,药晓江.散乱点云数据的曲率精简算法[J].北京理工大学学报,2010,30(7):785-789. 被引量:50
  • 7孙殿柱,朱昌志,范志先,李延瑞.基于型面特征的三维散乱点云精简算法[J].中国机械工程,2009(23):2840-2843. 被引量:7
  • 8熊邦书,何明一,俞华璟.三维散乱数据的k个最近邻域快速搜索算法[J].计算机辅助设计与图形学学报,2004,16(7):909-912. 被引量:65
  • 9FILIP D,MAGEDSON R,MARKOT R.Surface algorithms usingbounds on derivatives[J].Computer Aided Geometric Design,1987,3(4):295-311.

二级参考文献22

  • 1洪军,丁玉成,曹亮,武殿梁.逆向工程中的测量数据精简技术研究[J].西安交通大学学报,2004,38(7):661-664. 被引量:61
  • 2孙殿柱,范志先,李延瑞,孙肖霞.散乱数据点云型面特征分析算法的研究与应用[J].机械工程学报,2007,43(6):133-136. 被引量:31
  • 3Chen Y H,Neg C T,Wang Y Z. Data Reduction in Integrated Reverse Engineering and Rapid Prototyping[J]. International Journal of Computer Integrated Manufacturing, 1999,12(2) : 97-103.
  • 4Zhu Q,Gong J,Zhang Y T. An Efficient 3D R-tree Spatial Index Method for Virtual Geographic Environments[J]. ISPRS Journal of Photogrammertry and Remote Sensing,2007,62(3) :217-224.
  • 5Norbert B, Hans- Peter B,Ralf S,et al. The R* - tree: An Efficient and Robust Access Method for Points and Reetangles[C]//International Conference on Management of Data. Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data. New York, 1990 : 322-331.
  • 6Brakastsoulas S, Pfoser D, Ttheodoridis Y. Revisiting R-tree Construction Principles[C]//Proceedings of the 6th East European Conferences on Ad vances in Databases and Information Systems. London, 2002:149-162.
  • 7Kobbelt L P, Botsch M, Schwanecke U, et al. Feature sensitive surface extraction from volume data [A]. In:Computer Graphics Proceedings, Annual Conference Series, ACM, SIGGRAPH, Los Angeles, CA, 2001. 57~66
  • 8Goodsell. G. On finding p-th nearest neighbors of scattered points in two dimensions for small p [J]. Computer Aided Geometric Design, 2000,17(4): 387~ 392
  • 9Dickerson M T, Drysdale R L S, Sack J R. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors [J ]. International Journal of Computational Geometry and Applications, 1992, 2(3): 221~239
  • 10Piegl L A, Tiller W. Algorithm for finding all k nearest neighbors [J]. Computer-Aided Design, 2002, 34(2): 167~172

共引文献131

同被引文献84

引证文献12

二级引证文献134

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部