loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT'04)
Progressive Compression of Volumetric Subdivision Meshes
Thessaloniki, Greece
September 06-September 09
ISBN: 0-7695-2223-8
Daniel Laney, Lawrence Livermore National Laboratory
Valerio Pascucci, Lawrence Livermore National Laboratory
We present a progressive compression technique for volumetric subdivision meshes based on the slow growing refinement algorithm. The system is comprised of a wavelet transform followed by a progressive encoding of the resulting wavelet coefficients.
We compare the efficiency of two wavelet transforms. The first transform is based on the smoothing rules used in the slow growing subdivision technique. The second transform is a generalization of lifted linear B-spline wavelets to the same multi-tier refinement structure. Direct coupling with a hierarchical coder produces progressive bit streams. Rate distortion metrics are evaluated for both wavelet transforms.
We tested the practical performance of the scheme on synthetic data as well as data from laser indirect-drive fusion simulations with multiple fields per vertex. Both wavelet transforms result in high quality trade off curves and produce qualitatively good coarse representations.
Citation:
Daniel Laney, Valerio Pascucci, "Progressive Compression of Volumetric Subdivision Meshes," 3dpvt, pp.680-687, Second International Symposium on 3D Data Processing, Visualization and Transmission (3DPVT'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.