基于三角形折叠的网格简化算法

MESH SIMPLIFICATION ALGORITHM BASED ON TRIANGLE COLLAPSE

在计算机图形学中，物体常常用三角形网格模型来描述．本文提出了一种新的基于三角形折叠的网格简化算法．该网格简化算法不仅能减少模型中的三角形数目而巨能保持模型拓扑结构．算法给出了一种基于点到平面距离的有效的误差控制方法，并能在用户指定的误差范围内通过使原始网络中的三角形折叠达到大量简化的目的．该算法实现简单且速度快．另外为了有效地支持多分辨率模型的表示以及相邻层次模型间的连续过渡，本文还给出了一种基于三角形折叠的累进网格的构造方法．文中给出的一组实例说明了该算法的有效性．

In computer graphics, objects are often represented by triangle mesh.This paper presents a new algorithm of mesh simplification based on triangle collapse. The mesh simplification algorithm can not only decimate the number of triangles of models but also keep the topology of models. It can provide efficient error management and simplify the original mesh greatly. To store multi-resolution model efficiently and support continuous transition between adjacent level of detail models, a method to construct progressive meshes is also given. Examples illustrate efficiency of the algorithm.