一种新的三角形网格压缩算法

现代图形应用系统需要绘制大量的几何体，这给绘制硬件带来内存、带宽等问题。解决该问题的方法之一就是在预处理阶段对静态三维几何物体进行压缩处理。本文提出了一种新的三角形网格压缩／解压缩算法，该算法将三角形网格分解成一组三角形条和序列顶点链，然后对顶点连通性进行熵缟码。该算法与已有的GTM压缩算法相比，压缩率提
高了32％，并且支持并行解压缩。本文还提出了一种平行四边形预测方法来压缩顶点坐标。

A New Triangle Mesh Compression Algorithm

Modern graphics application systems have to render many geometric datasets, thus facing the problems of memory and bandwidth. One general solution to this is to compress the static 3-D geometric objects at the preprocessing phase. This paper presents a new triangle mesh compression/decompression algorithm, which breaks down a triangle mesh into a set of triangle strips and vertex chains, and then encodes vertex connectivity with entropy encoding. This algorithm provides a 32% improvement in the compression ratio over the existing GTM compression algorithm and supports parallel decompression. This paper proposes a parallelogram prediction method for vertex coordinate compression.