Sciweavers

Share
SIGGRAPH
2000
ACM

Progressive geometry compression

12 years 6 months ago
Progressive geometry compression
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;
Andrei Khodakovsky, Peter Schröder, Wim Sweld
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where SIGGRAPH
Authors Andrei Khodakovsky, Peter Schröder, Wim Sweldens
Comments (0)
books