一种新的边折叠网格模型简化算法  

New mesh simplification algorithm based on edge collapse

作　　者：王继东[1] 张芸[2] 杨斌[1] 

机构地区：[1]滁州学院计算机科学与技术系,安徽滁州239000 [2]滁州职业技术学院信息工程系,安徽滁州239000

出　　处：《计算机工程与应用》2013年第1期195-198,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60873175);安徽高校省级自然科学研究项目(No.KJ2011Z278;No.KJ2011Z284);滁州学院自然科学基金(No.2010kj015B)

摘　　要：在边折叠简化方法的基础上,提出一种用体积变化的平方作为误差度量的三角网格简化算法。算法中引入三角形法向约束因子的概念,并把它嵌入到边折叠误差矩阵中;能够自适应地分配简化网格的疏密,保持更多的模型几何特征。实验表明,该算法简化误差低,模型视觉质量高,简化效果较好。Based on edge collapse, this paper proposes a novel mesh simplification algorithm. The algorithm uses the square of volume change measure of the models as an improved error metrics to guide the decimation process, and embeds a new normal constraint factor of triangles into the edge-collapse error matrix. The algorithm can control local triangle density of the resulted models adaptively, as well as reserve model shape features of the original models. The experimental results show that the algo-rithm can create better simplificated models with lower simplification error than the existed algorithms.

关 键 词：网格简化 边折叠 三角形法向约束因子 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]