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

Connectivity compression of triangle meshes based on geometric parameter predict

作　　者：魏潇然 耿国华[1] 张雨禾[1] 

机构地区：[1]西北大学信息科学与技术学院,陕西西安710127

出　　处：《西安电子科技大学学报》2015年第5期194-199,共6页Journal of Xidian University

基　　金：国家自然科学基金资助项目(61373117;61172170)

摘　　要：为进一步优化三角网格模型拓扑编码压缩率,提出一种无损拓扑压缩算法.该算法首先将三角网格模型剖切成图,然后将剖切图表示成三角节点树,将剖切图中的三角带间拓扑结构内蕴在叶子节点、分支节点的邻接关系中,减少了模型压缩时需要编码存储的网格拓扑信息;最后使用顶点的几何信息和最小内角最大原则对三角带内拓扑结构预测,仅对预测错误的元素编码,进一步减少了需要编码存储的网格拓扑信息.与已有的压缩算法对三角网格的遍历编码方式相比,该算法不需要遍历三角网格编码存储,仅需要存储少量网格拓扑结构和预测信息.实验结果表明,该算法处理各类三角网格模型时压缩率有较大降低.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.

关 键 词：拓扑压缩 预测编码 三角网格 剖切图 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]