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

一种边折叠三角网格简化算法
引用本文:杜晓晖,尹宝才,孔德慧.一种边折叠三角网格简化算法[J].计算机工程,2007,33(12):12-15.
作者姓名:杜晓晖  尹宝才  孔德慧
作者单位:北京工业大学多媒体与智能软件技术北京市重点实验室,北京,100022
基金项目:国家自然科学基金 , 北京市自然科学基金 , 北京市市管高等学校人才强教计划基金
摘    要:针对目前自动网格简化算法在大规模简化时往往丢失模型重要几何特征的问题,该文提出了一种改进的边折叠三角网格简化算法。在Garland算法基础上引入三角形重要度概念,并加入到误差测度中,使得二次误差测度不仅能够度量距离偏差,而且能够反映模型局部表面几何变化。实验结果表明新的算法在保持二次误差测度快速特点的同时,使得简化模型在较低分辨率下能够保持更多的重要几何特征,有效地降低了视觉失真。

关 键 词:网格简化  边折叠  二次误差测度  三角形重要度
文章编号:1000-3428(2007)12-0012-04
修稿时间:2007-01-17

Triangle Mesh Simplification Algorithm Based on Edge Collapse
DU Xiaohui,YIN Baocai,KONG Dehui.Triangle Mesh Simplification Algorithm Based on Edge Collapse[J].Computer Engineering,2007,33(12):12-15.
Authors:DU Xiaohui  YIN Baocai  KONG Dehui
Affiliation:Beijing Multimedia and Intelligent Software Key Laboratory, Beijing University of Technology, Beijing 100022
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.
Keywords:Mesh simplification  Edge collapse  Quadric error metric  Important degree of triangle
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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