几何数据压缩的一种新算法

本文提出一种几何数据压缩的新算法，其基本思想是在已知物体网格边界的条件下，首先寻找边界的凹点，然后建立网格结点的特殊树结构，即横切面树，并将横切面树中相邻节点内网格结点之间的关系表示为链表（三角形条带），按契约数结构及链表（三角形条带）编码、存储帮传输网格结点的连接关系，这种算法不同于Gabriel Taubin算法，它具有对顶点坐标、属性坐标及三角形连接关系压缩无损等许多优点。

A New Algorithm for Geometric Data Compression

This paper presents a new algorithm for geometric data compression.The method is,under the condition that the mesh boundary of an object is known,to first find the concave point on the boundary, to establish the special tree structure of the mesh nodes(i.e.the transverse section tree),to represent the relation between the mesh nodes inside the adjacent vertices in the transverse section tree as a link list(triangle strip),and to encode, store and transfer the connective relation of the mesh nodes according to its tree structure and link list(triangle strip).This algorithm is different from Gabriel Taubin's algorithm.It is lossless compression for the vertex coordinate,property coordinates and connective relation of the triangle,etc.