采用半边编码的三角网格拓扑数据结构-计算机辅助设计与图形学学报.PDFVIP

第28 卷 第2 期 计算机辅助设计与图形学学报 Vol. 28 No.2 2016 年2 月 Journal of Computer-Aided Design Computer Graphics Feb. 2016 采用半边编码的三角网格拓扑数据结构 张应中, 谢馥香, 罗晓芳, 王钦瑞 (大连理工大学机械工程学院 大连 116024) (zhangyz@dlut.edu.cn) : 为了更紧凑地表示三角网格的几何和拓扑信息, 充分利用三角网格中的面、顶点和半边之间的语义关系和 隐含信息, 提出一个采用半边编码的三角网格拓扑数据结构. 首先建立以顶点序列表示的三角面对象, 并存放在动 态数组中; 将半边表示为所属三角面在数组中的下标和顶点连线顺序隐式关系的二元组, 并且编码为一个无符号长 整型数; 在顶点对象中设置外出半边属性, 在三角面对象中设置相邻面的 3 个反向半边属性; 通过对设置的半边信 息进行解码, 实现拓扑信息查询. 基于该数据结构开展了 STL 三角网格数据的拓扑重建实验, 在对内存空间需求、重 建效率和拓扑信息处理能力等方面, 与目前广泛使用的半边数据结构进行了比较,表明需求内存空间大为减少. ：三角网格; 拓扑信息; 半边数据结构; STL 拓扑重建 ：TP391.41 A Topological Data Structure Using Coding of Half-edges for Triangle Meshes Zhang Yingzhong, Xie Fuxiang, Luo Xiaofang, and Wang Qinrui (School of Mechanical Engineering, Dalian University of Technology, Dalian 116024) Abstract: In order to get a more compact representation of the geometric and topological information for triangle meshes, a topological data structure using coding of half-edges is proposed, which makes full use of the implied information and semantic relationships among triangular facets, vertices and half-edges. In the proposed data structure, a triangular face object is stored in a dynamic array. A half-edge is represented as a two-tuple consisting of an array index of the incident face and an order number of linking vertexes, and then is encoded into an un- signed long integer. In the vertex object, an attribute representing an outgoing half-edge is set. In the face object, three attributes representing adjacent opposite half-edges are set. The topology information of the triangle mesh can be efficiently queried by decoding the related half-edges. Based on the proposed data structure, a topological recon