【摘要】 提出一个通用的一般多边形网格的几何压缩算法 .针对目前三维拓扑压缩算法大都仅适用于三角网格的现状 ,在已有算法的基础上 ,进行了有效的推广 ,使得对于包含任意边数多边形的网格都可以进行有效的压缩编码 ;另外 ,根据多边形网格任一多边形中的各个顶点共面的特性 ,提出一种顶点坐标压缩方案 ,该方案与上述拓扑压缩算法有机结合可以显著地减少一般多边形网格数据在网上传输所需的带宽 ;最后 ,对编码过程产生的输出流进行游程编码与算术编码相结合的混合压缩编码 ,从而进一步提高压缩比更多还原

【Abstract】 In this paper a new geometry compression algorithm for general polygon meshes is introduced. Unlike most existing algorithms for triangular meshes, the approach of the paper encodes the connectivity information of general polygon meshes by implicitly subdividing each polygon into triangles in a predefined order. Based on the coplanar characteristic of a polygon, a compression scheme for vertex coordinates is described. Both run length encoding and arithmetic encoding are employed to achieve higher compression ratio. Experimental results show the scheme can significantly reduce the bandwidth to transfer general polygon meshes over Internet.更多还原