三维几何数据压缩新算法  

New Algorithm for 3D Geometry Compression

作　　者：秦爱红[1] 陈礼民[2] 

机构地区：[1]山西大学计算机与信息技术学院,太原030006 [2]山西大学计算机中心,太原030006

出　　处：《计算机辅助设计与图形学学报》2004年第7期913-917,共5页Journal of Computer-Aided Design & Computer Graphics

摘　　要：采用带双标记位顺序存储的三角形传播树表示三维模型的顶点坐标和顶点间的拓扑连接关系 ,利用特殊的数据结构和结点间的拓扑相关性和几何连贯性 ,可以同时达到较小的失真和较高的压缩比 ,避免了解压缩时对所有结点任意随机存取带来的内存空间不足的问题 由于拓扑信息和几何信息可以同时解码 ,使解压缩和图形绘制可以并行完成 ,进一步提高了速度 与已有算法相比 ,文中算法具有精度高。Triangle expanding tree is introduced with its nodes arranged in sequential order and using double flags for representing vertex coordinates along with their topological connection Special data structure utilizing the geometric coherence of connected nodes in 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 parallel, resulting in higher processing speed Comparing with existing algorithms, this method has some obvious advantages such as higher precision of modeling, faster processing speed and higher compression ratio

关 键 词：几何压缩 三角形网格 传播法 

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