三维网格模型数据流压缩算法研究  

Research of triangle mesh stream compression

作　　者：王金龙[1] 姜昱明[1] 

机构地区：[1]西安电子科技大学计算机学院,陕西西安710071

出　　处：《计算机工程与设计》2007年第22期5449-5452,共4页Computer Engineering and Design

摘　　要：当前的网格压缩算法在编码顶点和连通信息之前,需要按照某种顺序遍历网格模型,而且需要构造支持拓扑结构访问的临时数据结构,不利于处理大型网格模型。从根源上抛弃了传统网格数据组织形式,给出了一种新的网格顶点和连通信息交错的网格数据组织方法,提出了以网格数据读入顺序渐进编码算法。实验结果表明,算法的处理速度和所占用的内存空间都优于传统的压缩方法。Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabyte-sized mesh input where the construction and the usage of the data structures that support topological traversal queries become I/O-inefficient and require large amounts of temporary disk space. A scheme is proposed that incrementally encodes a mesh in the order it is given to the compressor using only minimal memory resources, This makes the compression process practically independent of the mesh size. The simulation results show that this scheme gives much better performances.

关 键 词：数据流压缩 三角形网格 大型网格模型 活动顶点 定位 

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