期刊文献+

基于局部的全自动网格修复算法 被引量:1

An Automatic Surface-Based Mesh Repairing Algorithm
下载PDF
导出
摘要 为了提高复杂三维外形模型的网格修复鲁棒性和准确性,提出一种基于局部的全自动网格修复算法.首先,对瑕疵类型进行自动识别,将其自动分划为洞、退化三角形、自交和非流形等不同类别;然后,针对不同瑕疵类别分别采用类动态规划方法、混合内核方法和裁剪缝合方法等相应的策略进行修复;最后,设计出一个完善的修复流程以确保高效、准确地完成整体的网格修复.以Thingi10K数据集为例,以修复后的模型能否被填充四面体为标准,与6种经典算法进行对比,实验结果表明,所提算法不仅可以准确地保持原模型的几何特征,并且其修复成功率为90%. In order to improve the robustness and exactness of mesh repairing for complex 3D models,an automatic surface-based mesh repairing algorithm is presented.Firstly,the flaws are automatically identified and divided into different categories such as holes,degenerate triangles,self-intersection,nonmanifold,etc.Secondly,for different flaw categories,the appropriate strategies such as dynamic programming like method,hybrid kernel method,and cutting and stitching method are used to repair mesh accordingly.Finally,an appropriate process is designed to ensure the mesh repairing is effective and efficient.Taking whether the repaired model can be filled with tetrahedrons as a standard,the proposed approach is compared with the six state-of-the-art approaches on Thingi10K dataset.The experimental results show that the proposed algorithm can keep geometric features of the original models,and the repairing success rate is 90%.
作者 王骁 雷娜 罗钟铉 Wang Xiao;Lei Na;Luo Zhongxuan(School of Software Technology,Dalian University of Technology,Dalian 116024;International School of Information Science&Engineering,Dalian University of Technology,Dalian 116024)
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2022年第9期1391-1401,共11页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(61720106005,61772105,61936002)。
关键词 网格修复 补洞 网格自交 mesh repairing hole filling self-intersections for mesh
  • 相关文献

参考文献1

二级参考文献16

  • 1杜佶,张丽艳,王宏涛,刘胜兰.基于径向基函数的三角网格曲面孔洞修补算法[J].计算机辅助设计与图形学学报,2005,17(9):1976-1982. 被引量:42
  • 2张洁,岳玮宁,王楠,汪国平.三角网格模型的各向异性孔洞修补算法[J].计算机辅助设计与图形学学报,2007,19(7):892-897. 被引量:24
  • 3Davis J, Marscher S R, Garr M, et al. Filling holes in complex surfaces using volumetric diffusion[C] //Proceedings of the 1st International Symposium on 3D Data Processing Visualization, and Transmission. Los Alamitos: IEEE Computer Society Press, 2002:428-438.
  • 4Ju T. Robust repair of polygonal models[C] //Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 2004:888-895.
  • 5Liepa P. Filling holes in meshes [C] //Proceedings of the Eurographics/ACM SIGGRAPH Symposium on Geometry Processing. Aire-la-Ville: Eurographies Association Press, 2003:200-205.
  • 6Zhao W, Gao S M, Lin H W. A robust hole filling algorithm for triangular mesh [J]. The Visual Computer, 2007, 23 (12) : 987-997.
  • 7Levy B. Dual domain extrapolation [C] //Computer C-raphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 2003 : 364-369.
  • 8Brunton A, Wuhrer S, Shu C, et al. Filling holes in triangular meshes by curve unfolding [C] //Proceedings of IEEE International Conference on Shape Modeling and Applications. Beijing: Institute of Electrical and Electronics Engineers Press, 2009: 66-72.
  • 9Jun Y T. A pieeewise hole filling algorithm in reverse engineering [J]. Computer-Aided Design, 2005, 37(2): 263- 270.
  • 10Nealen A, lgarashi T, Sorkine O, et al. Laplacian mesh optimization[C]//Proceedings of the 4th International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia. New York: ACM Press, 2006:381-389.

共引文献12

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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