STL模型的分层邻接排序快速切片算法

An Algorithm for Rapid Slicing of STL Model Based on Sorting by Triangle Adjacency in Layers

为提高STL模型切片效率,节省系统资源,提出STL模型分层邻接排序快速切片算法.采用邻接插入法建立三角形邻接关系,根据三角形各点坐标在切片方向上投影的最大值和最小值反求与此三角形相交的切片平面,并通过分析相邻2个三角形公共边与切片平面的位置关系,按邻接顺序建立交点链表.与已有的基于STL全模型拓扑信息提取的切片算法以及分组矩阵切片算法相比,文中算法不进行整体拓扑信息的提取和三角形的分组排序,而是将三角形顺序关系融合于交点链表中,从而达到节省系统资源、提高切片效率的目的.最后通过对壳体实体切片实例的分析,验证了该算法的可行性和高效性.

An algorithm for rapid slicing of STL model based on sorting by triangle adjacency in layers is proposed, which establishes adjacency relationship between triangle meshes by adopting method of adjacency insertion. The slicing planes intersecting with the triangle meshes are determined by slicing precision associated with minimum and maximum values of projection of each vertex of triangles on normal direction of the slicing plane. Through comparing the relationships between the common edge of two adjacent triangle meshes and the slicing plane, intersection link lists are established. In contrast to existing algorithms based on complete topological information reconstruction and grouping sort, this algorithm does not require complete topological information and grouping sort but records the adjacency relationship of triangle meshes into intersection link list in order to save system resources and increase slicing efficiency. The feasibility and efficiency of this algorithm is validated by testing on a STL model of piston.