Efficient compression of non-manifold polygonal meshes

André Guéziec, Frank Bossen, Gabriel Taubin, Claudio Silva
1999 Computational geometry  
Figure 1 : A: cutting a non-manifold mesh (two tetrahedra sharing a face). B: representing a non-manifold mesh as a manifold mesh together with a vertex clustering. C: Overall compressed syntax for a non-manifold mesh. Abstract We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a
more » ... onversion process, and fail to retrieve the original model connectivity after decompression. The present method works by converting the original model to a manifold model, encoding the manifold model using an existing mesh compression technique, and clustering, or stitching together during the decompression process vertices that were duplicated earlier to faithfully recover the original connectivity. This paper focuses on efficiently encoding and decoding the stitching information. By separating connectivity from geometry and properties, the method avoids encoding vertices (and properties bound to vertices) multiple times; thus a reduction of the size of the bit-stream of about 10% is obtained compared with encoding the model as a manifold.
doi:10.1016/s0925-7721(99)00027-9 fatcat:kpdpildhmbdwvicwm5r2wbpz4m