Compression and progressive transmission of three-dimensional models

Geometry compression concerns the representation of three-dimensional objects. The goal of geometry compression is to find an efficient way to express models created from both the physical world and virtual reality applications. The benefits of geometry compression include the saving of storage and network bandwidths, among others. In this thesis, we first review related techniques that have been extensively used in 3D model compression and coding algorithms. Then we present a novel structure to organize a general class of polygonal mesh surfaces. Our compressed representation prevents error accumulation through careful numerical analysis. In order to obtain optimal compression results, we make full use of and improve existing 2D image compression and coding techniques so as to remove the redundancy within 3D objects to the maximum extent. In our compression framework, a new second-order prediction scheme is introduced to locate and remove possible redundant geometric information, as well as provide a compact representation to organize connectivity information. The embedded bit stream supports resilience and error recovery. To support progressive transmission, two approaches are taken. First, geometry progressive transmission is achieved by using the successive quantization technique. Second, a two-phase scheme is designed to construct multiresolution surfaces. The latter approach gives a compact progressive connectivity representation, while displaying the ability of both topology preserving and topology non-preserving decomposition and reconstruction, demonstrating the efficiency and flexibility of our approach.

[1]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[2]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[3]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[4]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

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

[6]  Charles T. Loop,et al.  Smooth Subdivision Surfaces Based on Triangles , 1987 .

[7]  Mike M. Chow,et al.  Optimized geometry compression for real-time rendering , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[8]  Thomas W. Sederberg,et al.  Conversion of complex contour line definitions into polygonal element mosaics , 1978, SIGGRAPH.

[9]  John W. Woods,et al.  Handbook of visual communications , 1995 .

[10]  J.B. O'Neal Waveform quantization and coding , 1977, Proceedings of the IEEE.

[11]  Henry Fuchs,et al.  Optimal surface reconstruction from planar contours , 1977, SIGGRAPH.

[12]  Ronald A. DeVore,et al.  Image compression through wavelet transform coding , 1992, IEEE Trans. Inf. Theory.

[13]  Ian H. Witten,et al.  Arithmetic coding revisited , 1998, TOIS.

[14]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[15]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

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

[17]  Leila De Floriani,et al.  Hierarchical triangulation for multiresolution surface description , 1995, TOGS.

[18]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

[19]  Tony DeRose,et al.  Multiresolution analysis for surfaces of arbitrary topological type , 1997, TOGS.

[20]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

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

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

[23]  Peter Schröder,et al.  Interactive multiresolution mesh editing , 1997, SIGGRAPH.

[24]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1991, CACM.

[25]  Of references. , 1966, JAMA.

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

[27]  S. Ganapathy,et al.  A new general triangulation method for planar contours , 1982, SIGGRAPH.

[28]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

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

[30]  Michael Zyda,et al.  Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

[31]  Valerio Pascucci,et al.  Compression and Coding of Large CAD Models , 1998 .

[32]  Kenneth R. Sloan,et al.  Surfaces from contours , 1992, TOGS.

[33]  Chandrajit L. Bajaj,et al.  Decimation of 2D Scalar Data with Error Control , 1995 .

[34]  L. Kinsey Topology of surfaces , 1993 .

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

[36]  Kenneth Eustace,et al.  VRML 2.0 Sourcebook (Second edition) , 1998 .

[37]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[38]  Edward J. Coyle,et al.  Arbitrary Topology Shape Reconstruction from Planar Cross Sections , 1996, CVGIP Graph. Model. Image Process..

[39]  C.-C. Jay Kuo,et al.  Progressive compression of 3D graphic models , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[40]  Steven Skiena,et al.  Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[41]  Russell H. Taylor,et al.  Superfaces: polyhedral approximation with bounded error , 1994, Medical Imaging.

[42]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[43]  Valerio Pascucci,et al.  Error resilient streaming of compressed vrml , 1998 .

[44]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[45]  Valerio Pascucci,et al.  Fast isocontouring for improved interactivity , 1996, VVS '96.

[46]  Rémi Ronfard,et al.  Triangulating multiply‐connected polygons: A simple, yet efficient algorithm. , 1994, Comput. Graph. Forum.