Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits

The polygon mesh is an important primitive used in representing 3D models. Its specification consists of topological and geometrical quantities; where the former describes the connection nodes, edges and faces, and the latter describes attributes such as node positions, face colors, etc. Our interest here lies with the encoding of the topology. Specifically, this paper presents a linear-time information-theoretically optimal compression algorithm for encoding a planar 2-manifold polygon mesh to a bit string X.