期刊文献+

结合网格分割和边折叠的网格简化算法 被引量:3

Mesh Simplification Algorithm Combined with Mesh Segmentation and Edge Collapse
下载PDF
导出
摘要 传统网格简化算法简化效率较低,且在大幅度简化时难以保持网格模型的外形特征。为此,提出一种结合网格分割和边折叠的网格简化算法。采用分水岭算法对网格模型进行分割,以提高网格模型的简化效率。在Garland算法折叠代价函数的基础上,加入三角形形状和相邻曲面弯曲程度的相关因子,从而更好地保持网格模型的外形特征。实验结果表明,该算法在网格模型的简化速度和外形特征保持方面性能较好。 Focused on the issue of low efficient of mesh simplification algorithm and appearance feature missing in the case of greatly simplification, this paper presents a mesh simplification algorithm. It uses a watershed algorithm for mesh segmentation to improve the efficiency of the mesh mode and adds related fhctors of the shape of triangle and the bending degree of adjacent face on the basis of the edge collapse cost function of Garland algorithm to better maintain the appearance feature of mesh model. Experimental result shows that the algorithm has a distinct superiority in the speed of mesh simplification and appearance features.
出处 《计算机工程》 CAS CSCD 2012年第17期245-248,共4页 Computer Engineering
基金 国家自然科学基金资助项目(51108209) 江苏省研究生科研创新计划基金资助项目(CX07B_125z) 江苏省环保科研课题基金资助项目(201035)
关键词 网格简化 网格分割 分水岭算法 边折叠 多分辨率模型 mesh simplification mesh segmentation watershed algorithm edge collapse multi-resolution model
  • 相关文献

参考文献8

  • 1Hoppe H, Derose T, Duchamp T. Mesh Optimization[C]//Proc. of the 20th Conference on Computer Graphics and Interactive Techniques. New York, USA: ACM Press, 1993.
  • 2Michael G, Heckbert P S. Surface Simplification Using Quadric Error Metrics[J]. Computer Graphics, 1997, 31 (3): 209-216.
  • 3Lindstrom P, Turk G. Fast and Memory Efficient Polygonal Simplification[C]//Proc. of VIS'98. Los Alamitos, USA: IEEE Computer'Society, 1998.
  • 4Algorri M E, Schmitt F. Mesh Simplification[J]. Computer Graphics Forum, 1996, 15(3): 77-86.
  • 5全红艳,张田文,董宇欣.一种基于区域分割的几何模型简化方法[J].计算机学报,2006,29(10):1834-1842. 被引量:20
  • 6Wang Hailing, Yin Guisheng, Zhang Jing. An Efficient Mesh Simplification Algorithm[C]//Proc. of the 4th International Conference on Internet Computing for Science and Engineering. Harbin, China: [s. n.], 2009.
  • 7王永皎,郑春峰.基于边优化的三角网格简化算法[J].计算机工程,2009,35(20):205-207. 被引量:5
  • 8李成军,张弛,汪国平.交互标记控制的快速网格分割[J].北京大学学报(自然科学版),2006,42(5):662-667. 被引量:8

二级参考文献30

  • 1孙玉文,刘健,刘伟军.快速成型中STL数据模型的B-Rep实体精确重建[J].计算机辅助设计与图形学学报,2004,16(7):944-949. 被引量:6
  • 2潘翔,张三元,张引,叶修梓.一种基于拓扑连接图的三维模型检索方法[J].计算机学报,2004,27(9):1250-1255. 被引量:22
  • 3Hoppe H, Derose T, Duchamp T, et al. Mesh Optimization[J]. Proceedings of SIGGRAPH'93, 1993, 27(8): 19-26.
  • 4Garland M, Heckbert P S. Surthce Simplification Using Quadric error Metrics[J]. Proceedings of SIGGRAPH'97, 1997, 31(3): 209-216.
  • 5Turk G.Retiling Polygonal Surfaces[J]. Proceedings of SIGGRAPH'92, 1992, 26(2): 55-64.
  • 6Hoppe H. Progressive Meshes[J]. Proceedings of SIGGRAPH'96, 1996, 30(1): 99-108.
  • 7ZUCKERBERGER E, TAL A, SHLAFMAN S. Polyhedral surface decomposition with applications [J]. Computers and Graphics, 2002, 26(5) : 733-743.
  • 8LI X, TOON T, TAN T, et al. Decomposing polygon meshes for interactive applications [ C ]. Proceedings of the Symposium on Interactive 3D Graphics, Research Triangle Park, NC, 2001: 35-42.
  • 9PAGE D L, KOSCHAN A F, ABIDI M A. Perception-based 3D triangle mesh segmentation using fast marching watersheds [ C ]. Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition,Madison, WI, USA, 2003, Ⅱ :27-32.
  • 10MANGAN A P, WHITAKER R T. Partitioning 3D surface meshes using watershed segmentation [ J ]. IEEE Transactions on Visualization and Computer Graphics, 1999,5(4) : 308-321.

共引文献30

同被引文献18

引证文献3

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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