基于PM算法的网格简化改进算法  

Improved Mesh Simplification Algorithm Based on PM Algorithm

作　　者：陈立潮[1] 夏少芳[1] 成洪静[1] 刘佳[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《计算机工程》2008年第20期238-240,246,共4页Computer Engineering

基　　金：山西省自然科学基金资助项目(20051044)

摘　　要：针对传统网格简化算法在对边界顶点和边界边、累进网格二义性以及网格拓扑关系有效保持等的处理所存在的不足进行了相应的改进,改进的网格简化算法能有效保持网格模型的形体特征,消除累进网格的二义性,提高网格简化质量。针对折叠误差进行排序问题,采用最小堆算法,提高算法的时间效率。实验结果表明,该算法能产生高质量的网格,具有较高的执行效率。Aiming at the deficiencies of the traditional mesh simplification algorithms in the process of boundary vertexes and edges, ambiguity of progressive and keep mesh＇s topological properties, the improvements are made. The improved algorithm can maintain the mesh physical characteristic effectively, eliminate the ambiguity of progressive mesh and improve the quality of mesh simplification. The use of the smallest stack to rank the folded error improves the time efficiency of the algorithm. Experimental results show that the improved algorithm can produce high-quality mesh and have very high efficiency in the implementation.

关 键 词：边折叠 点分裂 二次误差测度 网格简化 

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