基于加权二次误差测度的边折叠简化算法  

Edge Collapse Simplification Based on Weighted Quadric Error Metrics

作　　者：杜晓晖[1] 尹宝才[1] 孔德慧[1] 

机构地区：[1]北京工业大学计算机学院多媒体与智能软件技术北京市重点实验室,北京100022

出　　处：《北京工业大学学报》2007年第7期731-736,共6页Journal of Beijing University of Technology

基　　金：国家自然科学基金(60572104;60533030);北京市自然科学基金(4061001).

摘　　要：针对许多边折叠网格简化算法在模型进行大规模简化后,不能很好地保持原始模型的重要几何特征,从而产生较严重的视觉失真现象的问题,提出了2种改进的二次误差测度边折叠方法．定义2种三角形重要度并嵌入到原始Garland的二次误差测度中,使得误差测度不仅能度量距离偏差,而且能反映模型局部表面几何变化．结果表明,新的算法在大规模简化后仍然能保留相当多的重要几何特征,降低了视觉失真．After drastic simplification process, most of the existing simplification algorithms based on edge collapse do not preserve important shape features of the original model very well and lead to visual distortion. This paper presents two edge-collapse based algorithms using improved quadric error metrics. Two important degrees of a triangle are given and embedded into the original Garland＇ s quadric error metrics, so that the metrics can not only measure distance error but also reflect geometric variations of local surface. The experimental results show that the novel algorithms can preserve quite a number of important shape features and reduce visual distortion even after performing drastic level of simplification.

关 键 词：计算机图形学 表面简化 迭代方法 边折叠 二次误差测度 

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