Single-resolution compression of arbitrary triangular meshes with properties

We propose a new layering structure to partition an arbitrary triangular mesh (no-manifold and arbitrary-genus) into generalized triangle strips. An efficient and flexible encoding of the connectivity, vertex coordinates and attribute data yields excellent single-resolution compression. This scheme gracefully solves the "crack" problem and also prevents error propagation while providing efficient prediction coding for both geometry and photometry data such as positions, color, normal, and texture coordinates. We present an encoder and decoder. We introduce a layering scheme to partition input data, we address the coding of connectivity and geometry, and discuss the attribute coding. Experimental results are presented.