Progressive Geometry Compression
Andrei Khodakovsky, Peter Schröder, Wim Sweldens
Proceedings of SIGGRAPH 2000, July 2000, pp. 271--278.
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.
Keyword(s): Compression algorithms, signal processing, wavelets, subdivision surfaces, semi-regular meshes, zerotree coding, hierarchical representations
BibTeX format:
@inproceedings{Khodakovsky:2000:PGC,
  author = {Andrei Khodakovsky and Peter Schröder and Wim Sweldens},
  title = {Progressive Geometry Compression},
  booktitle = {Proceedings of SIGGRAPH 2000},
  pages = {271--278},
  month = jul,
  year = {2000},
}
Search for more articles by Andrei Khodakovsky.
Search for more articles by Peter Schröder.
Search for more articles by Wim Sweldens.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."