首页 | 本学科首页   官方微博 | 高级检索  
     

基于近平面合并的三角网格简化算法
引用本文:杨姣,李光,罗守华. 基于近平面合并的三角网格简化算法[J]. 软件, 2011, 32(5): 14-17. DOI: 10.3969/j.issn.1003-6970.2011.05.004
作者姓名:杨姣  李光  罗守华
作者单位:东南大学生物科学与医学工程学院,江苏南京,210096
基金项目:苏州市科技发展计划项目(2009年)技术专项——基于显微医学成像技术的牙科CBCT关键技术研究及产品开发,编号:7711000009
摘    要:提出一种基于近平面合并的三角网格简化算法,针对三维重建MarchingCubes算法中产生的大量三角片进行简化。首先依据近平面判断条件将近似共面的三角形合并成一个大的多边形,然后按相应的准则将其重新进行三角化得到更少的三角形面片,以达到简化的目的。该算法在最大化的保留图像细节的前提下,精简了三角片的数目,提高了重建后图像绘制和传输的速率,节省了存储空间和处理时间。

关 键 词:Marching  Cubes算法  网格简化  超面  三角化

Triangular Mesh Simplification Algorithm Based on Approximate Coplanar Triangles Merging
YANG Jiao,LI Guang,LUO Shouhua. Triangular Mesh Simplification Algorithm Based on Approximate Coplanar Triangles Merging[J]. Software, 2011, 32(5): 14-17. DOI: 10.3969/j.issn.1003-6970.2011.05.004
Authors:YANG Jiao  LI Guang  LUO Shouhua
Affiliation:YANG Jiao,LI Guang,LUO Shouhua (School of Biological Science & Medical Engineering,Southeast University,Nanjing Jiangsu 210096,China)
Abstract: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 reserv...
Keywords:Marching Cubes algorithm  mesh simplification  superface  triangularization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号