Fast topological reconstruction algorithm for a STL file
Wang Zengb · Journal of Computer Applications · 2014
Because the lack of the necessary topological relation between graphic factors, through analyzing the STL( Stereolithographic) format file and reading it, and using the hash table as a lookup table, the topological relation among various elements of three-dimensional model is quickly created. Using the Hash table, this algorithm created the point table and the surface table for the elements, and realized the topological reconstruction. The time complexity of this algorithm is O( n), while the space complexity of this algorithm is O( 3n +( 4 + m) f + m). Finally, the algorithm was compared with the direct algorithm and red-black tree algorithm through five examples, and the results show that the proposed algorithm costs less time and the model with 650 thousand triangular facets can be reconstructed within 2. 3 seconds on PC.