基于C++标准模板库的STL数据拓扑重建  

Topology reconstruction of STL data based on C++ standard template library

作　　者：郑毅[1,2] 郑苹[3] 

机构地区：[1]南京航空航天大学民航/飞行学院,江苏南京210016 [2]山东工商学院信息与电子工程学院,山东烟台264005 [3]华中科技大学图像识别与人工智能研究所,湖北武汉430074

出　　处：《工程设计学报》2013年第6期522-528,共7页Chinese Journal of Engineering Design

基　　金：国家自然科学基金资助项目(60970105;61173173);山东省自然科学基金资助项目(ZR2012FL09);山东省住房和城乡建设厅科技项目(2011YK060);山东省高等学校科研计划项目(J11LG12)

摘　　要：针对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 STIr 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.

关 键 词：拓扑重建 立体光造型文件 半边结构 红黑树 标准模板库 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]