一种改进的基于三角形折叠的模型简化算法  

An Improved Algorithm of Model Simplification Based on Triangle Collapse

作　　者：朱春[1] 曾亮[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《计算技术与自动化》2006年第3期48-50,共3页Computing Technology and Automation

基　　金：国家973计划课题资助(2002CB312105)

摘　　要：本文基于三角形折叠的网格简化算法,提出了一种改进的算法。算法计算三角形顶点到相关平均平面的距离的最大值,结合三角形的面积、表面属性和预设特征给出三角形权值,确定折叠次序;并能够用累进网格实现连续的层次细节模型。该算法实现简单,运算速度快,而且能够有效保持模型预设的重要特征。This paper presents an improved algorithm based on triangle collapse. From calculating the maximum distance between the vertexes and their related average plane for each triangle, and based on the triangle area, surface attribute and the predefined characteristics, the algorithm gives out the triangle＇s weight, the collapse orders of triangle and makes a continuous level of detail model. This algorithm can not only keep the characteristics of the model but also compute on high speed.

关 键 词：模型简化 三角形折叠 层次细节 累进网格 

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