作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (12): 12-15. doi: 10.3969/j.issn.1000-3428.2007.12.005

• 博士论文 • 上一篇    下一篇

一种边折叠三角网格简化算法

杜晓晖,尹宝才,孔德慧   

  1. (北京工业大学多媒体与智能软件技术北京市重点实验室,北京 100022)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-20 发布日期:2007-06-20

Triangle Mesh Simplification Algorithm Based on Edge Collapse

DU Xiaohui, YIN Baocai, KONG Dehui   

  1. (Beijing Multimedia and Intelligent Software Key Laboratory, Beijing University of Technology, Beijing 100022)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-20 Published:2007-06-20

摘要: 针对目前自动网格简化算法在大规模简化时往往丢失模型重要几何特征的问题,该文提出了一种改进的边折叠三角网格简化算法。在Garland算法基础上引入三角形重要度概念,并加入到误差测度中,使得二次误差测度不仅能够度量距离偏差,而且能够反映模型局部表面几何变化。实验结果表明新的算法在保持二次误差测度快速特点的同时,使得简化模型在较低分辨率下能够保持更多的重要几何特征,有效地降低了视觉失真。

关键词: 网格简化, 边折叠, 二次误差测度, 三角形重要度

Abstract: This paper presents an improved quadric error metric edge-collapse based algorithm which can keep the speed and efficiency of quadric error metric and reserve more important shape features even after performing drastic level of simplification. It defines an important degree of a triangle and embeds it into the original Garland’s quadric error metric, so that the metric can not only measure distance error but also reflect geometric variations of local surface. The experimental results show that the new algorithm can reserve quite a number of important shape features and reduce visual distortion effectively at low levels of detail.

Key words: Mesh simplification, Edge collapse, Quadric error metric, Important degree of triangle

中图分类号: