Lossless Compression of Adaptive Multiresolution Meshes

Please always quote using this URN: urn:nbn:de:0296-matheon-5855
  • Abstract—We present a novel coder for lossless compression of adaptive multiresolution meshes that exploits their special hierarchical structure. The heart of our method is a new progressive connectivity coder that can be combined with leading geometry encoding techniques. The compressor uses the parent/child relationships inherent to the hierarchical mesh. We use the rules that accord to the refinement scheme and store bits only where it leaves freedom of choice, leading to compact codes that are free of redundancy. To illustrate our scheme we chose the widespread red-green refinement, but the underlying concepts can be directly transferred to other adaptive refinement schemes as well. The compression ratio of our method exceeds that of state-of-the-art coders by a factor of 2 to 3 on most of our benchmark models.

Download full text files

Additional Services

Share in Twitter Search Google Scholar
Author:Felix Kälberer, Konrad Polthier, Christoph von Tycowicz
Referee:Ralf Kornhuber
Date of first Publication:2009/08/27
Institute:Freie Universität Berlin
Technische Universität Berlin
Zuse Institute Berlin (ZIB)
MSC-Classification:65-XX NUMERICAL ANALYSIS / 65Mxx Partial differential equations, initial value and time-dependent initial- boundary value problems / 65M50 Mesh generation and refinement
Preprint Number:661