期刊文献+

一种基于三角网格模型的空洞填补方法 被引量:5

A METHOD FOR HOLES FILLING IN TRIANGULAR MESH MODEL
下载PDF
导出
摘要 为解决三角网格模型的空洞填补问题,提出一种识别、提取、分离空洞边缘的方法流程,并且利用一种改进的三维多边形三角化算法进行空洞填补。首先,根据网格模型空洞边缘的固有性质,对网格模型的边界边进行提取;然后,对提取的边界边集合进行包括孤立点、非封闭边等异常值的消除;再利用空洞边缘封闭的性质单独分离每个空洞边缘;最后,利用一种改进的三维多边形三角化算法对每个分离出来的空洞边缘进行填补。与通常的空洞填补算法相比,所提出的方法具有更好的鲁棒性,能够处理更复杂更大的空洞边缘和三角网格模型,并且能够最大限度地保持原型,同时对空洞有较平滑的填补效果,在恢复医学三维模型以及数字三维扫描模型的完整性中有很好的应用。 In order to solve the problem of holes filling in triangular mesh model, we propose a method and the process for the hole boundary edges identification, extraction and separation, and make use of an improved 3D polygon triangulation algorithm to fill the holes. First, the boundary edges are extracted from the mesh model according to inherent nature of the holes edges in mesh model. Then, the abnormal values including outliers and non-closed edges in extracted boundary edges set are removed. Next, the closed nature of the holes edge is used to separate every hole edge individually. Finally, the hole edges are filled using the improved 3D polygon triangulation algorithm. Compared with usual holes filling algorithms, the method presented in this paper has a better robustness, it is able to handle more complex and larger hole edges and triangular mesh models while preserving the original shapes to maximum extent, and meanwhile a relatively smooth effect of hole filling can be achieved too. This method can be well applied in restoring the integrity of 3D medieal models and digital 3D scanning models.
出处 《计算机应用与软件》 CSCD 北大核心 2014年第6期188-191,共4页 Computer Applications and Software
基金 国家高技术研究发展计划(2012AA021105)
关键词 三角网格模型 空洞填补 三角化 Triangular mesh model Holes filling Triangulation
  • 相关文献

参考文献12

  • 1IEEE. First International Symposium on 3D Data Processing, Visual- ization, and Transmission, Padua Italy, June 19 -21,2002[ C]. Con- ference Publications, 2002.
  • 2Tao Ju. Robust Repair of Polygonal Models[ J]. ACM Transactions on Graphics (TOG)-Proceedings of ACM SIGGRAPH, 2004,23:888 - 895.
  • 3ACM Siggraph. Symposium on Geometry Processing, Vienna Austria, July 4 - 6, 2005 [ C ]. Conference Publications, 2005.
  • 4Paul Louis George, Eric Seveno. The Advancing-Front Mesh Genera- tion Method Revisited[ J ]. International Journal for Numerical Methods in Engineering, 1994,37:3605 - 3619.
  • 5ISG. Eurographics, Dublin Ireland, August 29-September 2, 2005 [ C ]. Conference Publications, 2005.
  • 6David Eberly. Triangulation by Ear Clipping[ EB/OL]. http://www.geom etrictools. com/Documentation/TriangulationByEarClipping, pdf.
  • 7Alan Brunton, Stefanie Wuhrer, Chang Shu, et al. Filling Holes in Triangular Meshes by Curve Unfolding[ C ]. Shape Modeling Interna- tional, Beijing ,2009.
  • 8Lavanya Sita Tekumalla, Elaine Cohen. A Hole-Filling Algorithm for Triangular Meshes [ EB/OL ]. http ://citeseerx. ist. psu. edu/viewdoc/ download d? doi = 10.1.1. 142. 3960&rep = repl &type = pdf.
  • 9Kitware. VTK User' s Guide[ M]. USA:Kitware, 2010.
  • 10ISG. A Practical Gudie to Polygon Mesh Repairing Eurographics, Ca- gliari Italy, May 13 - 18, 2012[ C]. Conference Publications, 2012.

二级参考文献6

共引文献11

同被引文献43

  • 1王宏涛,张丽艳,李忠文,刘胜兰,周儒荣.基于RBF神经网络的三角网格曲面孔洞修补[J].中国机械工程,2005,16(23):2072-2075. 被引量:20
  • 2徐进军,张民伟.地面3维激光扫描仪:现状与发展[J].测绘通报,2007(1):47-50. 被引量:97
  • 3罗德安,廖丽琼.地面激光扫描仪的精度影响因素分析[J].铁道勘察,2007,33(4):5-8. 被引量:38
  • 4WANG Z,ZHANG L Q, FANG T,et al.. A muhiscale and hierarchical feature extraction method for terrestrial laser scanning point cloud Classification [ J ]. IEEE Transactions on Geoscience and Remote Sensing, 2015,53 ( 5 ) : 2409-2425.
  • 5WANG H Y, WANG C, LUO H ,et al.. 3-D point cloud object detection based on supervoxel neighborhood with hough forest framework[ J ]. IEEE J. Selected Topics in Applied Earth Observations and Remote Sensing,2015,8 (4) : 1570-1581.
  • 6MINK P, LEE S J, LEE K H. Multi-scale tensor voting for feature extraction from unstructured point clouds [ J ]. Graphical Models ,2012,74 (4) : 197-208.
  • 7WANG L C, HUNG Y C. Hole filling of triangular mesh segments using systematic grey prediction [ J ]. Computer-Aided Design,2012,44(12) : 1182-1189.
  • 8WANG X C,LIU X P, LU L F, et al.. Automatic hole-filling of CAD models with feature-preserving[ J ]. Computers & Graphics ,2012,36 ( 2 ) : 101-110.
  • 9FLOYD R W. Algorithm 97 : shortest path [ J ]. Communications of the Association for Computing Machinery, 1962,5 ( 6 ) : 345.
  • 10ZHAO W, GAO S M, LIN H W. A robust hole-filling algorithm for triangular mesh [ J ]. The Visual Computer,2007,23 (12) :987-997.

引证文献5

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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