Geometry compression based on mantissa chunking of vertices

The transmission of 3D shape models via the Internet has become one of the hottest issues these days. Presented in this paper is a new approach for the rapid transmission of the geometric data of a shape model. By analysing three important factors for the data compression (the shape fidelity, the file size and the decompression time), we point out the potential problems with the previous approach of using the deltas between consecutive vertices and we propose an alternative of directly using the position values of the vertices of the model. It turns out that the proposed approach has a smaller file size, it has less distortion in the model, and the decompression is faster.

[1]  Hwan-Gue Cho,et al.  An improved TIN compression using Delaunay triangulation , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

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

[3]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

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

[5]  이응석.  Vertex data compression for triangle mesh , 2000 .

[6]  Jarek Rossignac,et al.  Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker , 1999, Comput. Geom..

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

[8]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[9]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[10]  David R. Kincaid,et al.  Numerical mathematics and computing , 1980 .

[11]  Mike M. Chow.  Optimized geometry compression for real-time rendering , 1997 .

[12]  Michael T. Goodrich,et al.  Education forum: Web Enhanced Textbooks , 1998, SIGA.

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

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

[15]  J. Rossignac.  Edgebreaker: Compressing the incidence graph of triangle meshes , 1998 .

[16]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

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

[18]  Anders Thorup,et al.  Minimal Huffman trees , 2000, Acta Informatica.