Random Accessible Mesh Compression Using Mesh Chartification

Previous mesh compression techniques provide decent properties such as high compression ratio, progressive decoding, and out-of-core processing. However, only a few of them supports the random accessibility in decoding, which enables the details of any specific part to be available without decoding other parts. This paper proposes an effective framework for the random accessibility of mesh compression. The key component of the framework is a wire-net mesh constructed from a chartification of the given mesh. Charts are compressed separately for random access to mesh parts and a wire-net mesh provides an indexing and stitching structure for the compressed charts. Experimental results show that random accessibility can be achieved with competent compression ratio, which is only a little worse than single-rate and comparable to progressive encoding. To demonstrate the merits of the framework, we apply it to process huge meshes in an out-of-core manner, such as out-of-core rendering and out-of-core editing.

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

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

[3]  Gabriel Taubin.  3D geometry compression recent advances and challenges , 2001, Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001.

[4]  Konrad Polthier,et al.  FreeLence ‐ Coding with Free Valences , 2005, Comput. Graph. Forum.

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

[6]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

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

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

[9]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

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

[11]  Martin Isenburg,et al.  Streaming compression of triangle meshes , 2005, SIGGRAPH '05.

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

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

[14]  Martin Isenburg,et al.  Large mesh simplification using processing sequences , 2003, IEEE Visualization, 2003. VIS 2003..

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

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

[17]  D. Manocha,et al.  Cache-oblivious mesh layouts , 2005, ACM Trans. Graph..

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

[19]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[20]  Peter Lindstrom,et al.  Out-of-core construction and visualization of multiresolution surfaces , 2003, I3D '03.

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

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

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

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

[25]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[26]  Seungyong Lee,et al.  Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes , 2006, Computer Graphics International.

[27]  Peter Lindstrom,et al.  Random-Accessible Compressed Triangle Meshes , 2007, IEEE Transactions on Visualization and Computer Graphics.

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

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

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

[31]  Michael Garland,et al.  A multiresolution representation for massive meshes , 2005, IEEE Transactions on Visualization and Computer Graphics.

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

[33]  Insung Ihm,et al.  3D RGB image compression for interactive applications , 2001, TOGS.

[34]  Martin Isenburg,et al.  Lossless compression of predicted floating-point geometry , 2005, Comput. Aided Des..

[35]  Hugues Hoppe.  Smooth view-dependent level-of-detail control and its application to terrain rendering , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[36]  C.-C. Jay Kuo,et al.  Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition , 2005, ACM Trans. Graph..

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

[38]  Neil A. Dodgson,et al.  Advances in Multiresolution for Geometric Modelling , 2005 .

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

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

[41]  C.-C. Jay Kuo,et al.  Technologies for 3D mesh compression: A survey , 2005, J. Vis. Commun. Image Represent..

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

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

[44]  Seungyong Lee,et al.  Multiresolution Random Accessible Mesh Compression , 2006, Comput. Graph. Forum.

[45]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[46]  Pierre Alliez,et al.  Recent advances in compression of 3D meshes , 2005, 2005 13th European Signal Processing Conference.

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

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

[49]  H. Seidel,et al.  Mesh Compression with Random Accessibility , 2004 .

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

[51]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[52]  Joan L. Mitchell,et al.  MPEG Video: Compression Standard , 1996 .

[53]  E. Gobbetti,et al.  Far voxels: a multiresolution framework for interactive rendering of huge complex 3D models on commodity graphics platforms , 2005, ACM Trans. Graph..

[54]  Paolo Cignoni,et al.  Adaptive tetrapuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models , 2004, ACM Trans. Graph..