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

Abstract

In order to solve the problem that the topological relationship between the triangular facets is lost when the 3D 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 established through a hash table, and a collection containing half-edges in which no adjacency facets are added is maintained therein. According to the set and topology algorithm, the topological relationship of the facets is improved, and the topological relationship of the facets is quickly established in the process of reading data.

Keywords

• stl file
• half-edges structure
• hash table
• topology algorithm