三维几何数据压缩新算法.pdfVIP

计算机辅助设计与图形学学报 Vo 1.16 , No.7 第 16 卷第7 期 2004 年 7 月 JOURNAL OF COMPUTER-AIDED DESIGN COMPUTER GRAPHICS July , 2004 三维几何数据压缩新算法 陈礼民2) 秦爱红1) 1)(山西大学计算机与信息技术学院 太原 030006) 2) (山西大学计算机中心 太原 030006) 摘 要 采用带双标记位顺序存储的三三角形传播树表示二三维模型的顶点坐标和顶点间的拓扑连接关系，利用特殊 的数据结构和结点间的拓扑相关性和几何连贯性，可以同时达到较小的失真和较高的压缩比，避免了解压缩时对所 有结点任意随机存取带来的内存空间不足的问题.由于拓扑信息和几何借息可以同时解码，使解脱缩和图形绘制可 以并行完成，进一步提高了速度.与巳有算法相比，文中算法具有精度高、速度快和高压缩比等特点. 关键诩 几何压缩;三角形网将;传播法 中阴法分类号 TP39 1.41 New Algorithm for 3D Geometry Compression 2 Qin Aihong 1) Chen Limin ) I) (Schο01 of Ccmputer and Information Technology ， 彻anxi University , Taiyuan 030006) 2)( Computer Center Shanxi University , Taiyuan 030006) Abstract Triangle expanding tree is introduced with its nodes arranged in sequential order and using double flags for representing vertex c∞rdinates along with theìr topological connection. Special data structure utilizing the geometric coherence of connected nodes iil. the tree guarantees higher compression ratio and higher precision of shape representation. Furthermore , the presented method needs less storage space due to its ordered access to the linked vertices. As the connections and coordinates of model vertices can be decompressed simultaneously , it becomes possible to decompress and render in paralle l, resulting in higher processing speed. Comparing wìth existìng algorithms , this method has some obvious advantages such as higher precision of modeling , faster processing speed and higher compresslon ratlO. Key words geometry compression j triangle mesh; expanding algorithm 色、法向、纹班组标等脯性，一般是每个三角形独立 问 - 世 地由其3 个顶点的 9 个坐标来表述.如果用撑点数 1 51