Recent advances in compression of 3D meshes

3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space. Applications calling for compact storage and fast transmission of 3D meshes have motivated the multitude of algorithms developed to efficiently compress these datasets. In this paper we survey recent developments in compression of 3D surface meshes. We also list some open questions and directions for future research.

[1]  Andrei Khodakovsky,et al.  Globally smooth parameterizations with low distortion , 2003, ACM Trans. Graph..

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

[3]  Martin Isenburg,et al.  Compressing hexahedral volume meshes , 2002, 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings..

[4]  Olivier Devillers,et al.  Geometric compression for interactive transmission , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

[5]  Xiong Wang.  /spl alpha/-surface and its application to mining protein data , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[6]  Xin He,et al.  Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses , 1998, ICALP.

[7]  Pedro V. Sander,et al.  Signal-Specialized Parametrization , 2002, Rendering Techniques.

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

[9]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[10]  Stefan Gumhold,et al.  Improved cut-border machine for triangle mesh compression , 1999 .

[11]  Hyeong-Seok Ko,et al.  Vertex data compression for triangular meshes , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[12]  H. Helson.  Harmonic Analysis , 1983 .

[13]  Leif Kobbelt,et al.  Simplification and Compression of 3D Meshes , 2002, Tutorials on Multiresolution in Geometric Modelling.

[14]  Craig Gotsman,et al.  On the optimality of spectral compression of mesh data , 2005, TOGS.

[15]  Olivier Devillers,et al.  Progressive lossless compression of arbitrary simplicial complexes , 2002, SIGGRAPH.

[16]  Pierre Alliez,et al.  Progressive compression for lossless transmission of triangle meshes , 2001, SIGGRAPH.

[17]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

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

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

[20]  Craig Gotsman,et al.  Optimized compression of triangle mesh geometry using prediction trees , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

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

[22]  Jarek Rossignac,et al.  An Edgebreaker-based efficient compression scheme for regular meshes , 2001, Comput. Geom..

[23]  Marco Attene,et al.  SwingWrapper: Retiling triangle meshes for better edgebreaker compression , 2003, TOGS.

[24]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, ICALP.

[25]  Craig Gotsman,et al.  Explicit Surface Remeshing , 2003, Symposium on Geometry Processing.

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

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

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

[29]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

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

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

[32]  Jerome M. Shapiro,et al.  Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..

[33]  Sivan Toledo,et al.  High-Pass Quantization for Mesh Encoding , 2003, Symposium on Geometry Processing.

[34]  Craig Gotsman,et al.  Efficient coding of non-triangular mesh connectivity , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[35]  D. Cohen-Or,et al.  Multi-way Geometry Encoding , 2002 .

[36]  Andrei Khodakovsky,et al.  Compression of Normal Meshes , 2004 .

[37]  Christian Böhm,et al.  Fast parallel similarity search in multimedia databases , 1997, SIGMOD '97.

[38]  John Hart,et al.  ACM Transactions on Graphics: Editorial , 2003, SIGGRAPH 2003.

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

[40]  Pedro V. Sander,et al.  Multi-Chart Geometry Images , 2003, Symposium on Geometry Processing.

[41]  Peter Schröder,et al.  Normal meshes , 2000, SIGGRAPH.

[42]  T. N. Bhat,et al.  The Protein Data Bank: unifying the archive , 2002, Nucleic Acids Res..

[43]  Craig Gotsman,et al.  Efficient Coding of Nontriangular Mesh Connectivity , 2001, Graph. Model..

[44]  Craig Gotsman,et al.  Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes , 2002, Comput. Graph. Forum.

[45]  Frederic PAYAN,et al.  3D mesh wavelet coding using efficient model-based bit allocation , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

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

[47]  Kaizhong Zhang,et al.  Automated Discovery of Active Motifs in Three Dimensional Molecules , 1997, KDD.

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

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

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

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

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

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

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

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

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

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

[58]  Kaizhong Zhang,et al.  Finding Patterns in Three-Dimensional Graphs: Algorithms and Applications to Scientific Data Mining , 2002, IEEE Trans. Knowl. Data Eng..

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

[60]  Sudhir P. Mudur,et al.  Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features , 2001, VMV.

[61]  Kenneth A. Ross,et al.  Making B+- trees cache conscious in main memory , 2000, SIGMOD '00.

[62]  Pierre Alliez,et al.  Anisotropic polygonal remeshing , 2003, ACM Trans. Graph..

[63]  Martin Isenburg,et al.  Binary compression rates for ASCII formats , 2003, Web3D '03.

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

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

[66]  David J. Kriegman,et al.  Compressing large polygonal models , 2001, Proceedings Visualization, 2001. VIS '01..

[67]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

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

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

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

[71]  Kenneth A. Ross,et al.  Making B+-Trees Cache Conscious in Main Memory , 2000, SIGMOD Conference.

[72]  Craig Gotsman,et al.  Efficient compression and rendering of multi-resolution meshes , 2002, IEEE Visualization, 2002. VIS 2002..