Research on Efficient Algorithm of Topological Reconstruction for STL Data

How to efficiently reconstruct the topological structure of a large number of STL data is a bottle-neck in reverse engineering.In this paper an integrated vertexes algorithm of AVL tree is introduced based on the V-F structure to delete a large number of redundant vertexes and reduce the size of data file up to 18％～25％ of the original one.Then,an optimal search algorithm based on virtual AVL tree is conducted to efficiently reconstruct the half-edge topological structure.Finally,some test examples show that the proposed algorithm is both efficient and extensible.