STL数据模型的快速切片算法  

Algorithm for rapid slicing STL model

作　　者：赵保军[1] 汪苏[1] 陈五一[1] 

机构地区：[1]北京航空航天大学机械工程及自动化学院,北京100083

出　　处：《北京航空航天大学学报》2004年第4期329-333,共5页Journal of Beijing University of Aeronautics and Astronautics

摘　　要：分析了现有的STL(stereolithography)模型切片处理算法的特点 ,在此基础上提出了基于分组矩阵和活性三角片表的切片算法 .该算法根据三角片的最小和最大z坐标以及切片厚度 ,建立三角片的分组矩阵和活性三角片表 ,并在活性三角片表中建立局部的三角片邻接拓扑关系 ,以减少在切片过程中对三角片的遍历次数、排序次数以及求交计算量 ,简化了切片轮廓环的构造过程 。The advantages and disadvantages of existing slicing algorithms for stereolithography(STL) model were analyzed, and an algorithm based on the grouping matrix and the active triangle table was developed. The grouping matrix and the active triangle table were established according to the minimum and maximum Z coordinates of the triangular facets. The traversing and sorting times for the triangular facets and the times of intersecting with the slicing plane in the slicing process were reduced, and the process of constructing the slice contour was simplified.

关 键 词：三角形矩阵 拓扑特点 快速成型 切片算法 三角片模型 

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