Connectivity compression for three-dimensional planar triangle meshes
We describe a new algorithm for coding the connectivity information of three-dimensional planar triangle meshes. Vertices of a mesh are placed on a two-dimensional grid. The connectivity pattern of the grid is implicit and hence the only information that needs to be encoded is the diagonal links. We present experimental results that show that the new method has a low connectivity cost of 2.1 bits per vertex on average.