一种三角形网格的优化算法  

An Algorithm for Triangular Mesh Optimization

作　　者：王崑凌[1] 

机构地区：[1]西安工程大学计算机与科学学院,陕西西安710048

出　　处：《电子科技》2010年第7期72-73,共2页Electronic Science and Technology

基　　金：西安工程大学校管基金资助项目(09XG04)

摘　　要：处理复杂三维模型时,采用边折叠方法进行三角形网格优化。并通过使二次误差测度最小来计算折叠点的坐标,既保留了原始网格的形状,又摆脱了折叠边的限制。实验结果证明,该算法不仅获得了简化效果且确保得到了质量较高的简化模型。An algorithm based on edge collapsing is used to optimize the triangular meshes.The new vertex is produced by the minimum quadric error metric to retain the original shape of the meshes as much as possible and avoid the limit of the folding border.Experimental results show that this algorithm is simplified to obtain good results and ensure a higher quality of the simplified model.

关 键 词：网格优化 二次误差测度 折叠点 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]