An efficient connectivity compression for triangular meshes

Edgebreaker and valence-driven approaches use split operations to separate the 3D model into two components. These algorithms raise some bottlenecks for spending increased overheads to record the displacement, or an extra operator is needed for identifying the branch. This study applies an edge-based compression strategy, and proposes using the J operator to skip to the next edge of the active boundary. By using Q operator, two triangles are encoded to improve compression ratio. Additionally, the method requires neither splitting model topology nor multiple passes to achieve a good compression rate. To increase the compression ratio, the adaptive arithmetic coder was applied to compress the CQRU string. The experimental results demonstrate that an excellent compression ratio can be obtained, the average compression ratio with the proposed model is better than that with the valence-driven and Edgebreaker methods. The entropy/compression ratio relation curve of the variance-driven method has strong vibration, and the proposed algorithm exhibits coherent tendency. The proposed algorithm has a fixed number and value distribution of operators, and thus only considers the context between operators in achieving the best compression ratio.

[1]  Pierre Alliez,et al.  Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes , 2002, Graph. Model..

[2]  Martin Isenburg,et al.  Triangle Strip Compression , 2000, Comput. Graph. Forum.

[3]  Jarek Rossignac,et al.  Edgebreaker: a simple implementation for surfaces with handles , 2003, Comput. Graph..

[4]  Bin Shyan Jong,et al.  Improved Edge-Based Compression for the Connectivity of 3D Models , 2004, IEICE Trans. Inf. Syst..

[5]  Jarek Rossignac,et al.  Guaranteed 3.67v bit encoding of planar triangle graphs , 1999, CCCG.

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

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

[8]  Martin Isenburg,et al.  Spirale Reversi: Reverse Decoding of the Edgebreaker Encoding , 1999, CCCG.

[9]  Bin Shyan Jong,et al.  An Efficient Edge-Based Compression Algorithm for 3D Models with Holes and Handles , 2006, J. Inf. Sci. Eng..

[10]  Jarek Rossignac,et al.  Edgebreaker: a simple compression for surfaces with handles , 2002, SMA '02.

[11]  Pierre Alliez,et al.  Valence‐Driven Connectivity Encoding for 3D Meshes , 2001, Comput. Graph. Forum.

[12]  Jarek Rossignac,et al.  An Edgebreaker-based efficient compression scheme for regular meshes , 2001, Comput. Geom..

[13]  Jarek Rossignac,et al.  Connectivity Compression for Irregular Quadrilateral Meshes , 2000, ArXiv.

[14]  Lihua Zhou,et al.  CONNECTIVITY COMPRESSION FOR TRIANGLE MESHES , 2003 .

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

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

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