Efficient compression of non-manifold polygonal meshes

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 conversion 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.

[1]  Jarek Rossignac,et al.  Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker , 1999, Comput. Geom..

[2]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[3]  Joan L. Mitchell,et al.  The Qx-coder , 1998, IBM J. Res. Dev..

[4]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[5]  Mike M. Chow Optimized geometry compression for real-time rendering , 1997 .

[6]  Valerio Pascucci,et al.  Single Resolution Compression of Arbitrary Triangular Meshes with Properties , 1999, Data Compression Conference.

[7]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[8]  Hugues Hoppe,et al.  Efficient implementation of progressive meshes , 1998, Comput. Graph..

[9]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[10]  Gabriel Taubin,et al.  Converting sets of polygons to manifold surfaces by cutting and stitching , 1998, Proceedings Visualization '98 (Cat. No.98CB36276).

[11]  C.-C. Jay Kuo,et al.  Progressive coding of 3-D graphic models , 1998, Proc. IEEE.

[12]  Christian Sohler,et al.  Encoding a triangulation as a permutation of its point set , 1997, CCCG.

[13]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[14]  Gabriel Taubin,et al.  Geometry coding and VRML , 1998, Proc. IEEE.

[15]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[16]  Jarek Rossignac,et al.  Matchmaker: manifold BReps for non-manifold r-sets , 1999, SMA '99.