DMCA
Progressive Geometry Compression (2000)
Cached
Download Links
- [www.multires.caltech.edu]
- [multires.caltech.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 238 - 13 self |
BibTeX
@MISC{Khodakovsky00progressivegeometry,
author = {Andrei Khodakovsky and Peter Schröder and Wim Sweldens},
title = {Progressive Geometry Compression},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist of three distinct components: geometry, parameter, and connectivity information. The latter two do not contribute to the reduction of error in a compression setting. Using semi-regular meshes, parameter and connectivity information can be virtually eliminated. Coupled with semi-regular wavelet transforms, zerotree coding, and subdivision based reconstruction we see improvements in error by a factor four (12dB) compared to other progressive coding schemes. CR Categories and Subject Descriptors: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling - hierarchy and geometric transformations; G.1.2 [Numerical Analysis]: Approximation - approximation of surfaces and contours, wavelets and fractals; I.4.2 [Image Processing and Computer Vision]: Compression (Coding) - Approximate methods Additional K...
Keyphrases
progressive geometry compression connectivity information compression setting computational geometry numerical analysis approximate method additional mesh consist sampled mesh approximation approximation object modeling hierarchy semi-regular mesh new progressive compression scheme subject descriptor computer vision arbitrary topology semi-regular wavelet transforms cr category distinct component geometric transformation computer graphic image processing
