针对STL文件存在大量冗余数据、缺少拓扑信息的问题，研究了顶点、边和三角面片之间拓扑关系重建算法。使用C＋＋标准模板库的容器和迭代器技术进行编程，借助红黑树结构，去除STL文件中的冗余数据，加速建立半边拓扑结构，并且能够快速完成指定的顶点、三角面片的邻域搜索，以及快速确定模型的边界。实验结果表明，该算法能够有效、稳定地完成STL数据的拓扑重建任务，并且效率优于改进的直接算法。%In view of a great deal of redundant vertexes and little topological information in a STL file ,we studied a topology reconstruction algorithm and reconstructed the topological information of vertexes ,edges and triangular facets .Containers and iterators of C+ + standard template li-brary were utilized to carry out the algorithm .Redundant vertexes were removed from the STL file based on a red-black tree structure ,and a half-edge topological structure was constructed . Neighborhood searched of appointed vertexes and triangular facets could be achieved rapidly .And a boundary of the model could be ascertained likewise .Experimental results show that the topologi-cal information of STL files can be reconstructed by the proposed algorithm efficiently and stably ,and the proposed algorithm has an advantage of efficiency over the improved naive algorithm .
展开▼
