【摘要】 针对三角面片之间存在繁杂冗余的拓扑关系，冗余数据繁杂直接影响后期切片处理的操作，提出一种基于广度优先搜索的STL文件拓扑优化的算法。当读入一个起始顶点时，通过广度优先搜索访问具有直接邻接关系的第一层顶点，同时标记每个顶点的时间标签顺序，接着更新三角面片的数组。通过广度优先搜索快速存储完所有的三角面片后，以VS2017和QT5.14为平台，利用OpenGL技术仿真模型显示原图和点云形式，为后续切片处理提供了方便。更多还原

【Abstract】 In view of the complex and redundant topological relationship between triangular patches, this paper introduces and analyzes the data structure and characteristics of STL files, and proposes a new STL file topology reconstruction algorithm based on breadth-first search. When a starting vertex is read in, the first level vertex with direct adjacency is accessed by breadth-first search, and the time tag and the order of edges of each vertex are marked at the same time. Then the array of triangular patches is updated. After quickly storing all the triangular patches through breadth-first search,using VS2017 and QT5.14 as the platform, the OpenGL technology simulation model is used to display the original image and point cloud form, which provides convenience for subsequent slice processing.更多还原