几何信息预测的三角网格模型拓扑压缩

doi:10.3969/j.issn.1001-2400.2015.05.032

Abstract

Abstract:

An efficient encoding algorithm for lossless compression of triangle mesh connectivity is presented to further optimize the compression ratio. The algorithm firstly cuts a given mesh into a cutaway graph, then uses a triangle nodes tree to present the graph, containing the triangle strips topology information on the graph in the adjacency relationships between the leaf nodes and the branch nodes, reducing the mesh topology information needed to be encoded. Finally, we use the minimum interior angle maximum principle to predict the internal topology of the triangle strips, only encoding the prediction error elements, thus further reducing the information needed to be encoded. Compared with the current compression algorithms, this algorithm does not traverse the triangular mesh, only encoding and storing a small amount of mesh topology information and prediction information. Experimental results show that the algorithm can greatly reduce the compression ratios and process various triangle meshes.

Key words: connectivity compression, predictive encoding, triangle mesh, cutaway graph

CLC Number:

TP391

WEI Xiaoran;GENG Guohua;ZHANG Yuhe. Connectivity compression of triangle meshes based on geometric parameter predict[J].J4, 2015, 42(5): 194-199.

References

［1］ Carey R, Bell G, Marrin C. ISO/IEC 14772-1: 1997 Virtual Reality Modeling Language (VRML97)［S］. The VRML Consortium Incorporated, 1997: 34.
［2］ Taubin G, Rossignac J. Geometric Compression through Topological Surgery［J］. ACM Transactions on Graphics, 1998, 17(2): 84-115.
［3］ Rossignac J. Edgebreaker: Connectivity Compression for Triangle Meshes［J］. IEEE Transactions on Visualization and Computer Graphics,1999, 5(1): 47-61.
［4］刘迎, 刘学慧, 吴恩华. 基于可变模版的三角网格拓扑压缩［J］. 软件学报, 2008, 19(04): 1015-1025.
Liu Ying, Liu Xuehui, Wu Enhua. Variable-code-mode-based Connectivity Compression for Triangular Meshes［J］. Journal of Software, 2008, 19(4): 1015-1025.
［5］ Alliez P, Desbrun M. Valence-driven Connectivity Encoding for 3D Meshes［J］. Computer Graphics Forum, 2001, 20(3): 480-489.
［6］ Cheng S C, Kuo C T, Wu D C. A Novel 3D Mesh Compression Using Mesh Segmentation with Multiple Principal Plane Analysis［J］. Pattern Recognition, 2010, 43(1): 267-279.
［7］ Gurung T, Luffel M, Lindstrom P, et al. LR: Compact Connectivity Representation for Triangle Meshes［J］. ACM Transactions on Graphics, 2011, 30(4): 1-8.
［8］ Gurung T, Luffel M, Lindstrom P, et al. Zipper: A Compact Connectivity Data Structure for Triangle Meshes［J］. Computer-Aided Design, 2013, 45(2): 262-269.
［9］ Luffel M, Gurung T, Lindstrom P, et al. Grouper: A Compact, Streamable Triangle Mesh Data Structure［J］. IEEE Transactions on Visualization and Computer Graphics, 2014, 20(1): 84-98.
［10］张洁, 吴佳泽, 郑昌文. 应用哈密顿回路的三角网格拓扑压缩［J］. 计算机辅助设计与图形学学报, 2013, 25(5): 697-707.
Zhang Jie, Wu Jiaze, Zheng Changwen. Connectivity Compression of Thriangle Meshes Based on Hamilton Cycle［J］. Journal of Computer-Aided Design ＆ Computer Graphics, 2013, 25(5): 697-707.
［11］ Maglo A, Grimstead I, Hudelot C. POMAR: Compression of Progressive Oriented Meshes Accessible Randomly［J］. Computers ＆ Graphics, 2013, 37(6): 743-752.
［12］ Vetro A, Frossard P, Lee S, et al. Introduction to the Special Section on 3D Representation, Compression, and Rendering［J］. IEEE Transactions on Image Processing, 2013, 22(9): 3513-3516.

Connectivity compression of triangle meshes based on geometric parameter predict

PDF (PC)

Like

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 1

Metrics

Comments

Recommended 8