逆向几何求交方法的STL模型分层算法

Slicing Algorithm of STL Model Based on Reverse Geometrical Intersection

为了解决三维网格曲面(STL)模型分层算法分层计算效率不高的问题,提出了一种可实现STL曲面模型快速分层的逆向几何求交算法。通过遍历三角面片顶点坐标,确定模型最小包围盒。利用分层面分割STL模型,散列表数据结构记录分层面坐标。在此基础上,计算连接截交线,生成模型轮廓,实现模型的快速分层。实验结果证明:该算法可对各种结构的STL模型进行分层,具有可靠、稳定和效率高等优点。

To solve the problems of the stereolithogrphy interface( STL) model slicing algorithm with poor efficiency in some cases,a reverse geometrical interrogations algorithm was proposed to realize the slicing algorithm of STL curved surface model. In the algorithm,the minimum bounding box of the model wasdetermined by traversing the triangle vertex coordinates. The STL surface model was sliced by using layered surface,and the coordinates of layered surface were recorded by using a data structure of hash table. On this basis,the intersection line was calculated and connected to obtain the hierarchical model,which realized the fast slicing for the STL surface model. Examples show that many STL models can be sliced by this algorithm. It also indicates that this algorithm is reliable,efficient and stable.