基于半边结构的STL文件快速拓扑算法  

Fast topology algorithm for STL files based on half-edges structure

作　　者：武小超 陈鸿 Wu Xiaochao;Chen Hong(School of Instrument and Electronics,North University of China,Taiyuan 030051,China)

机构地区：[1]中北大学仪器与电子学院

出　　处：《电子技术应用》2020年第1期92-95,99,共5页Application of Electronic Technique

摘　　要：针对三维模型转换为STL文件后会丢失三角面间的拓扑关系,在对STL格式文件进行读取和分析时,提出了一种基于半边结构和哈希表的快速拓扑重构算法。在读取数据过程中,通过哈希表建立无重复位置信息的点表,并在其中维护一个未添加邻接面的半边集合。依据该集合和拓扑算法完善面的拓扑关系,实现在读取数据的过程中快速建立面的拓扑关系。In order to solve the problem that the topological relationship between the triangular facets is lost when the 3 D model is converted to STL files, in the process of reading and analyzing STL files, a fast topology reconstruction algorithm based on half-edges structure and hash table is proposed. In the process of reading data, a point table without repeat position information is es-tablished through a hash table, and a collection containing half-edges in which no adjacency facets are added is maintained there-in. According to the set and topology algorithm, the topological relationship of the facets is improved, and the topological relation-ship of the facets is quickly established in the process of reading data.

关 键 词：STL文件 半边结构 哈希表 拓扑算法 

分 类 号：TN06[电子电信—物理电子学] P301.6[天文地球—地球物理学]