arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9909018cs.CGcs.GR
收藏

用于渐进传输的几何压缩

Geometric compression for progressive transmission

Olivier Devillers, Pierre-Maris Gandoin

摘要:

几何结构的压缩是数据压缩的一个相对较新的领域。大约从1995年开始,有几篇文章讨论了网格的编码,其中大多数使用了以下方法:网格的顶点按一定的顺序编码,使得它包含网格的部分拓扑结构。同时,一些简单的规则试图从先前编码的相邻顶点的位置预测当前顶点的位置。在这篇文章中,我们描述了一个压缩算法,其原理是完全不同的:顶点的顺序被用来压缩其坐标,然后从顶点的拓扑结构重建的网格。该算法,特别适合于地形模型,实现的压缩因子略大于目前可用的算法,而且,它允许渐进式和交互式传输的网格。

英文摘要:

The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order such that it contains partially the topology of the mesh. In the same time, some simple rules attempt to predict the position of the current vertex from the positions of its neighbours that have been previously coded. In this article, we describe a compression algorithm whose principle is completely different: the order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm, particularly suited for terrain models, achieves compression factors that are slightly greater than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑