Graph Coding and Connectivity Compression

This paper looks at the theoretic roots of current connectivity compression schemes to establish a visual framework within which the differences and similarities of various scheme become intuitive. We show the intimate connections between the classic work on planar graph coding by Turan and recent schemes, such as Edgebreaker, Face Fixer, and the optimal coding by method of Poulalhon and Schaefer. Furthermore we fit Touma and Gotsman’s valence coder into this classification. This helps to explain what information is hidden in the "split offsets" and suggests a strategy for doing valence coding without using offsets. Other results are an elegant method for reverse decoding of meshes encoded with Poulalhon and Schaefer’s optimal coder, and the insight that the classic Keeler and Westbrook method and the Edgebreaker scheme are really the same algorithm for the case of encoding planar triangulations. Finally, we conjecture that (a) optimal encodings are never streamable and (b) encodings that avoid offsets necessarily result in uncoherent mesh layouts.

[1]  Gabriel Taubin,et al.  Converting sets of polygons to manifold surfaces by cutting and stitching , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[2]  David Levin,et al.  Progressive Compression of Arbitrary Triangular Meshes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[3]  Martin Isenburg,et al.  Compressing polygon mesh geometry with parallelogram prediction , 2002, IEEE Visualization, 2002. VIS 2002..

[4]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[5]  Martin Isenburg,et al.  Compressing texture coordinates with selective linear predictions , 2003, Proceedings Computer Graphics International 2003.

[6]  Craig Gotsman,et al.  Efficient Coding of Non-Triangular Meshes , 2000, EuroCG.

[7]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[8]  Renato Pajarola,et al.  Compressed Progressive Meshes , 2000, IEEE Trans. Vis. Comput. Graph..

[9]  Jarek Rossignac,et al.  An Edgebreaker-Based Efficient Compression Scheme for Connectivity of Regular Meshes , 2000, CCCG.

[10]  Pierre Alliez,et al.  Angle‐Analyzer: A Triangle‐Quad Mesh Codec , 2002, Comput. Graph. Forum.

[11]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[12]  J. Rossignac,et al.  Wrap&zip: Linear decoding of planar triangle graphs , 1999 .

[13]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[14]  M. Isenburg.  Compressing Polygon Mesh Connectivity with Degree Duality Prediction , 2002, Graphics Interface.

[15]  Jarek Rossignac,et al.  Guaranteed 3.67v bit encoding of planar triangle graphs , 1999, CCCG.

[16]  A. Safonova,et al.  3D Compression Made Simple: Edgebreaker on a Corner-Table , 2001 .

[17]  Craig Gotsman.  On the Optimality of Valence‐based Connectivity Coding , 2003, Comput. Graph. Forum.

[18]  Marc Levoy,et al.  The digital Michelangelo project , 1999, Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062).

[19]  Jarek Rossignac,et al.  Piecewise Regular Meshes: Construction and Compression , 2002, Graph. Model..

[20]  Martin Isenburg,et al.  Mesh collapse compression , 1999, SCG '99.

[21]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[22]  Andrei Khodakovsky,et al.  Progressive geometry compression , 2000, SIGGRAPH.

[23]  Stefan Gumhold,et al.  New Bounds on The Encoding of Planar Triangulations , 2000 .

[24]  Gabriel Taubin,et al.  Building a Digital Model of Michelangelo's Florentine Pietà , 2002, IEEE Computer Graphics and Applications.

[25]  Xin He,et al.  Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings , 1999, SIAM J. Discret. Math..

[26]  Martin Isenburg,et al.  Compressing the Property Mapping of Polygon Meshes , 2002, Graph. Model..

[27]  Martin Isenburg,et al.  Early-split coding of triangle mesh connectivity , 2006, Graphics Interface.

[28]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

[29]  Gabriel Taubin,et al.  Efficient compression of non-manifold polygonal meshes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[30]  Nicolas Bonichon,et al.  An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation , 2003, STACS.

[31]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[32]  C.-C. Jay Kuo,et al.  A dual graph approach to 3D triangular mesh compression , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[33]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[34]  W. T. Tutte.  A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[35]  Craig Gotsman,et al.  Triangle Mesh Compression , 1998, Graphics Interface.

[36]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[37]  Valerio Pascucci,et al.  Single Resolution Compression of Arbitrary Triangular Meshes with Properties , 1999, Data Compression Conference.

[38]  Gabriel Taubin,et al.  Progressive forest split compression , 1998, SIGGRAPH.

[39]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[40]  Craig Gotsman,et al.  Spectral compression of mesh geometry , 2000, EuroCG.

[41]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[42]  Martin Isenburg,et al.  Face fixer: compressing polygon meshes with properties , 2000, SIGGRAPH.

[43]  Pierre Alliez,et al.  Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes , 2002, Graph. Model..

[44]  Jeffery R. Westbrook,et al.  Short Encodings of Planar Graphs and Maps , 1995, Discret. Appl. Math..

[45]  Jarek Rossignac,et al.  Connectivity Compression for Irregular Quadrilateral Meshes , 2000, ArXiv.

[46]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[47]  Gabriel Taubin,et al.  Geometry coding and VRML , 1998, Proc. IEEE.

[48]  Martin Isenburg.  Triangle Fixer: Edge-based Connectivity Compression , 2000, EuroCG.

[49]  Alon Itai,et al.  Representation of graphs , 1982, Acta Informatica.

[50]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[51]  Martin Isenburg,et al.  Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding , 1999, CCCG.