CaltechAUTHORS
  A Caltech Library Service

Progressive geometry compression

Khodakovsky, Andrei and Schröder, Peter and Sweldens, Wim (2000) Progressive geometry compression. In: SIGGRAPH '00 Proceedings of the 27th annual conference on Computer graphics and interactive techniques. ACM Press/Addison-Wesley Publishing , New York, NY, pp. 271-278. ISBN 1-58113-208-5. https://resolver.caltech.edu/CaltechAUTHORS:20161116-151004261

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20161116-151004261

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1145/344779.344922DOIArticle
http://dl.acm.org/citation.cfm?doid=344779.344922PublisherArticle
ORCID:
AuthorORCID
Schröder, Peter0000-0002-0323-7674
Additional Information:© 2002 ACM Press. Andrei Khodakovsky was partially supported through an internship at Lucent Technologies. Other support came from NSF (ACI-9624957, ACI-9721349, DMS-9872890, DMS-9874082), Alias|Wavefront, a Packard Fellowship, and the SGI-Utah Visual Supercomputing Center. Special thanks to Cici Koenig, Igor Guskov, Mathieu Desbrun, Aaron Lee, and Martin Vetterli. Datasets are courtesy Cyberware, the Stanford program in Computer Graphics and Hugues Hoppe. Our implementation uses an arithmetic coder of Geoff Davis and John Danskin. We are particularly grateful to Renato Pajarola, Craig Gotsman, and Gabriel Taubin for providing us with executables of their mesh compression algorithms.
Funders:
Funding AgencyGrant Number
Lucent TechnologiesUNSPECIFIED
NSFACI-9624957
NSFACI-9721349
NSFDMS-9872890
NSFDMS-9874082
Alias|WavefrontUNSPECIFIED
David and Lucile Packard FoundationUNSPECIFIED
SGI-Utah Visual Supercomputing CenterUNSPECIFIED
Subject Keywords:Compression algorithms, signal processing, wavelets, subdivision surfaces, semi-regular meshes, zerotree coding, hierarchical representations
Classification Code: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 [ Im
Record Number:CaltechAUTHORS:20161116-151004261
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20161116-151004261
Official Citation:Andrei Khodakovsky, Peter Schröder, and Wim Sweldens. 2000. Progressive geometry compression. In Proceedings of the 27th annual conference on Computer graphics and interactive techniques (SIGGRAPH '00). ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 271-278. DOI=http://dx.doi.org/10.1145/344779.344922
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:72070
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:17 Nov 2016 00:51
Last Modified:09 Mar 2020 13:19

Repository Staff Only: item control page