摘要
提出一种渐进几何压缩算法.通过对简化算法的改进,网格模型由基网格及多组顶点分裂操作序列表达.当从一层网格向下一层精网格细化时,该组顶点分裂操作序列中的分裂操作顺序是任意的.因此,改进的渐进网格表示可改变每组顶点分裂操作的排序,实现高效率编码.设计了Laplacian几何预测器,通过相邻顶点来预测新增顶点位置,并对位置校正值进行量化及Huffman编码.实验结果表明,该算法可获得高压缩比,适合几何模型的网络渐进传输.
A progressive geometry compression scheme is presented in this paper. In this scheme, a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be effectively encoded by permuting the vertex split operations in each group. Meanwhile, a Laplacian geometry predicator is designed to predict each new vertex position using its neighbors. The correction is quantized and encoded using Huffman coding scheme. Experimental results show that the algorithm can obtain higher compression ratios than the previous work. It is very suitable for progressive transmission of geometry models over Internet.
出处
《软件学报》
EI
CSCD
北大核心
2002年第9期1804-1812,共9页
Journal of Software
基金
国家自然科学基金资助项目(60133020
60021201
69925204)~~
