航空学报 > 2003, Vol. 24 Issue (6): 573-576

基于点簇合并的多边形表面模型简化算法研究

吴勃, 施法中   

  1. 北京航空航天大学机械工程及自动化学院 北京 100083
  • 收稿日期:2002-10-21 修回日期:2003-02-25 出版日期:2003-12-25 发布日期:2003-12-25

Vertex Clustering-Based Algorithm for Simplification of Polyhedral Model

WU Bo, SHI Fa zhong   

  1. School of Mechanical Engineering and Automation; Beijing University of Aeronautics and Astronautics; Beijing 100083; China
  • Received:2002-10-21 Revised:2003-02-25 Online:2003-12-25 Published:2003-12-25

摘要: 在计算机图形的动态实时显示技术中, 将高度密集的多边形表面模型用尽可能少的多边形逼近成为近年研究的焦点, 也出现了一批简化算法。针对存在的问题, 文中以累进网格为基础, 并将点簇合并引起的几何逼近作为研究重点, 将多种度量方法通过权因子统一到基于二次误差的模型逼近度量方法中, 并提出了改进的基于二次误差的多边形表面简化算法。实例表明该算法可快速、高质的实现逼近。该算法也适用于实时环境下的多边形网格的动态多分辨率表示。

关键词: 点簇合并, 二次误差, 网格优化, 累进网格, 多分辨率

Abstract: In dynamic realtime display o f computer graphics, it is the critical focus for the automat ic simplificat ion ofhig hly dense po lygonal sur face models to be approx imate as accur ately as possible by fewer poly gons. Sever al techniques for t he simplificatio n have been developed in recent years. Aimed at the ex istent problems, to take the geometrical approx imation error br ought for th by vertex clustering into consideration and start from pr ogressiv e meshes,some diverse measurement methods ar e unified to t he quadric-based measurement method o f an approx imation er rormodel by means of w eig ht facto rs. An improved quadric-based polygonal sur face simplification algor ithm is put forw ar d. Practical examples have shown it is faster and produces higher quality approximatio ns. It also fits dy namicmultiresolution in r ealtime render 3D engine.

Key words: vertex clustering, quadric error, meshes optimization, progressive meshes, multiresolution

中图分类号: