Near-optimal connectivity encoding of 2-manifold polygon meshes

  • Authors:

  • Andrei Khodakovsky;Pierre Alliez;Mathieu Desbrun;Peter Schröder

  • Affiliations:

  • Department of Computer Science, California Institute of Technology, Pasadena, California;INRIA Sophia-Antipolis, France;Department of Computer Science, University of Southern California, Los Angeles, California;Department of Computer Science, California Institute of Technology, Pasadena, California

  • Venue:
  • Graphical Models - Special issue: Processing on large polygonal meshes
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Encoders for triangle mesh connectivity based on enumeration of vertex valences are among the best reported to date. They are both simple to implement and report the best compressed file sizes for a large corpus of test models. Additionally they have recently been shown to be near-optimal since they realize the Tutte entropy bound for all planar triangulations. In this paper we introduce a connectivity encoding method which extends these ideas to 2-manifold meshes consisting of faces with arbitrary degree. The encoding algorithm exploits duality by applying valence enumeration to both the primal and the dual mesh in a symmetric fashion. It generates two sequences of symbols, vertex valences, and face degrees, and encodes them separately using two context-based arithmetic coders. This allows us to exploit vertex or face regularity if present. When the mesh exhibits perfect face regularity (e.g., a pure triangle or quad mesh) or perfect vertex regularity (valence six or four respectively) the corresponding bit rate vanishes to zero asymptotically. For triangle meshes, our technique is equivalent to earlier valence-driven approaches. We report compression results for a corpus of standard meshes. In all cases we are able to show coding gains over earlier coders, sometimes as large as 50%. Remarkably, we even slightly gain over coders specialized to triangle or quad meshes. A theoretical analysis reveals that our approach is near-optimal as we achieve the Tutte entropy bound for arbitrary planar graphs of two bits per edge in the worst case.