基于近平面合并的三角网格简化算法  

Triangular Mesh Simplification Algorithm Based on Approximate Coplanar Triangles Merging

作　　者：杨姣[1] 李光[1] 罗守华[1] 

机构地区：[1]东南大学生物科学与医学工程学院,江苏南京210096

出　　处：《软件》2011年第5期14-17,共4页Software

基　　金：苏州市科技发展计划项目(2009年)技术专项--基于显微医学成像技术的牙科CBCT关键技术研究及产品开发;编号:7711000009

摘　　要：提出一种基于近平面合并的三角网格简化算法,针对三维重建MarchingCubes算法中产生的大量三角片进行简化。首先依据近平面判断条件将近似共面的三角形合并成一个大的多边形,然后按相应的准则将其重新进行三角化得到更少的三角形面片,以达到简化的目的。该算法在最大化的保留图像细节的前提下,精简了三角片的数目,提高了重建后图像绘制和传输的速率,节省了存储空间和处理时间。In order to simplify the enormous triangles generated by the Marching Cubes algorithm,an algorithm proposed in this paper presents the triangular mesh model simplification based on approximate coplanar triangles merging.At first,approximate coplanar triangles are merged into one big polygon according to the merge conditions.Then,fewer triangles are obtained through the new triangulation in accordance to certain rules to reach the purpose of simplification.On the premise of maximizing the image detail reservation,the algorithm can reduce the amount of triangles,improve the rendering and transmission efficiency of the image from reconstruction and save the storage space and the time for data processing.

关 键 词：MARCHING CUBES算法 网格简化 超面 三角化 

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