基于面删除的四面体网格简化新算法  

A Novel Technique Based on Triangle Decimation for Tetrahedral Simplification

作　　者：王选明[1] 吴菊英[2] 吴恩华[1] 

机构地区：[1]中国科学院软件研究所计算机科学重点实验室中国科学院研究生院,北京100080 [2]空军工程大学,陕西西安710077

出　　处：《电子学报》2007年第12期2343-2346,共4页Acta Electronica Sinica

摘　　要：如何简化大规模数据集的几何和拓扑形状以便达到实时显示和绘制的目的,已经越来越引起人们的重视.本文提出一种基于面删除的四面体网格简化新算法.通过对网格中的所有三角形定义其删除的优先级别,删除优先级别高的三角形,以简单的几何删除操作来达到四面体网格简化的目的.和已有的方法比较起来,本方法的特点是每一步都有比较高的删除比例,每一次三角形的删除操作可以达到至少8个(2个面邻接四面体,至少6个边邻接四面体)四面体删除,测试模型中最多可以达到13个四面体的删除.本算法保持了边界节点和网格简化后的一致性.How to simplify a large scale tetrahedral dataset in order to use in the real time rendering is of more importance. A novel technique based on triangle decimation for tetrahedral simplification is described here. A triangle area ratio is defmed as cost function for every triangular in the model. Through this ratio, a list of priority sequences is obtained in the per-compute period . The Mangle which of high priority will be deleted firstly. Compared to the published paper, this method can be used to delete at least 8 tetrahedral in one triangle decimation cycle. In the test model,we can delete at most 13 tetrahedml one time. The results of this technique are of high practical use especially in the real time compression transformation of tetrahedml, finite element computation and rendering.

关 键 词：三角形 四面体 网格简化 优先级别 

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