首页 | 官方网站   微博 | 高级检索  
     

网格的渐进几何压缩
引用本文:秦绪佳,刘新国,鲍虎军,彭群生.网格的渐进几何压缩[J].软件学报,2002,13(9):1804-1812.
作者姓名:秦绪佳  刘新国  鲍虎军  彭群生
作者单位:1. 浙江大学,CAD&CG国家重点实验室,浙江,杭州,310027
2. 微软亚洲研究院,北京,100080
基金项目:国家自然科学基金资助项目(60133020;60021201;69925204)
摘    要:提出一种渐进几何压缩算法.通过对简化算法的改进,网格模型由基网格及多组顶点分裂操作序列表达.当从一层网格向下一层精网格细化时,该组顶点分裂操作序列中的分裂操作顺序是任意的.因此,改进的渐进网格表示可改变每组顶点分裂操作的排序,实现高效率编码.设计了Laplacian几何预测器,通过相邻顶点来预测新增顶点位置,并对位置校正值进行量化及Huffman编码.实验结果表明,该算法可获得高压缩比,适合几何模型的网络渐进传输.

关 键 词:三角网格  几何压缩  流形曲面  渐进网格
文章编号:1000-9825/2002/13(09)1804-09
收稿时间:3/1/2002 12:00:00 AM
修稿时间:2002年3月1日

Progressive Geometry Compression for Meshes
QIN Xu-ji,LIU Xin-guo,BAO Hu-jun and PENG Qun-sheng.Progressive Geometry Compression for Meshes[J].Journal of Software,2002,13(9):1804-1812.
Authors:QIN Xu-ji  LIU Xin-guo  BAO Hu-jun and PENG Qun-sheng
Abstract: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 desinged to predict each new verttex position using its neighbors.The correction is quantized and encoded using Huffman coding scheme.Experimental results show that the algorithm can obtain higer compression ratios than than the previous work.It is very suitable for progressive transmission of geometry models over Internet.
Keywords:triangular mesh  geometry compression  manifold surface  progressive mesh
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号