Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Context-based Coding of Adaptive Multiresolution Meshes

  • Multiresolution meshes provide an efficient and structured representation of geometric objects. To increase the mesh resolution only at vital parts of the object, adaptive refinement is widely used. We propose a lossless compression scheme for these adaptive structures that exploits the parent-child relationships inherent to the mesh hierarchy. We use the rules that correspond to the adaptive refinement scheme and store bits only where some freedom of choice is left, leading to compact codes that are free of redundancy. Moreover, we extend the coder to sequences of meshes with varying refinement. The connectivity compression ratio of our method exceeds that of state-of-the-art coders by a factor of 2 to 7. For efficient compression of vertex positions we adapt popular wavelet-based coding schemes to the adaptive triangular and quadrangular cases to demonstrate the compatibility with our method. Akin to state-of-the-art coders, we use a zerotree to encode the resulting coefficients. Using improved context modeling we enhanced the zerotree compression, cutting the overall geometry data rate by 7% below those of the successful Progressive Geometry Compression. More importantly, by exploiting the existing refinement structure we achieve compression factors that are 4 times greater than those of coders which can handle irregular meshes.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Christoph von Tycowicz, Felix Kälberer, Konrad Polthier
Document Type:Article
Parent Title (English):Computer Graphics Forum
First Page:2231
Last Page:2245
Fulltext Url:https://nbn-resolving.org/urn:nbn:de:0296-matheon-8389
Year of first publication:2011
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.