Lossless Compression of Adaptive Multiresolution Meshes

Felix Kälberer, Konrad Polthier, Christoph von Tycowicz
2009 2009 XXII Brazilian Symposium on Computer Graphics and Image Processing  
Figure 1 . Adaptive refinement of a bone model. Elements are colored according to our coding scheme. We store a bit for every blue and red triangle, specifying whether it is further refined or not. These bits are sufficient to reconstruct the connectivity of the model. All other triangles can be reconstructed using rules of the refinement scheme as explained in the text. Abstract-We present a novel coder for lossless compression of adaptive multiresolution meshes that exploits their special
more » ... archical 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.
doi:10.1109/sibgrapi.2009.53 dblp:conf/sibgrapi/KalbererPT09 fatcat:xwzr6unz7jbopi7x7gjmlws4yq