A Triangulating Algorithm for Cutting Cross-Section of STL Model

In order to meet the demands for triangulation of an STL model's cutting cross-section, a triangulating algorithm for cutting cross-section of STL model is presented. By the method, the region made by cross-sectional contours is divided into one or several region-cells to be triangulated respectively. According to the standard of STL, the Delaunay triangles are obtained on cutting cross-section. Using this algorithm, the complex convex set generation of cross-sectional contours and the transform from multi-contours to single contour are not needed, and therefore the efficiency of triangulation is enhanced greatly. This algorithm is especially suitable for triangulation on cross-section of STL model with multi-cavities and it is verified by some engineering cases.