STL格式文件拓扑重建及快速切片算法研究  

Research on the rapid slicing algorithm based on STL topology construction

作　　者：杨光[1,2,3] 刘伟军[1] 王维[2] 田凤杰[1,3] 

机构地区：[1]中国科学院沈阳自动化研究所,沈阳110016 [2]沈阳航空工业学院,沈阳110134 [3]中国科学院研究生院,北京100039

出　　处：《现代制造工程》2009年第10期32-35,共4页Modern Manufacturing Engineering

基　　金：国防基础科研项目(A3520061304)

摘　　要：建立三角面片之间拓扑关系是提高分层切片效率的关键因素之一,提出基于标准模板库set容器的拓扑关系重建算法及快速切片算法,有效地去除了STL文件大量冗余数据,简化了数据的存储,该算法每一个三角面片在每一切平面内只求一次交点,切片完成后可直接得到封闭轮廓环,以减少在切片过程中对三角面片的遍历次数、排序次数及求交点计算量,简化了轮廓环的构造过程,从而有效地提高了算法的效率。To efficiently reconstruct the topology of STL file is one of the key factors to improve efficiency of slicing algorithm. A topology reconstruction algorithm based on standard template library ＇ set＇ containers and a rapid slicing algorithm are developed, which remove a large number of redundant vertexes and only calculate intersection once per triangle per slice plane, and another point of intersection directly from the adjacent relations. And the algorithm also reduce the times of traversing and sorting for the triangular facets and the times of intersecting in the slice processes, and which simplify the process of constructing the slice contour,so as to effectively improve the efficiency of the slicing algorithm.

关 键 词：STL文件 快速成型 拓扑重构 切片算法 去除冗余 标准模板库 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]