STL模型分割截面的三角剖分算法  

A Triangulating Algorithm for Cutting Cross-Section of STL Model

作　　者：张征宇[1] 丁玉成[2] 洪军[2] 

机构地区：[1]中国空气动力研究与发展中心,绵阳621000 [2]西安交通大学机械工程学院,西安710049

出　　处：《计算机辅助设计与图形学学报》2005年第6期1240-1245,共6页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家"八六三"高技术研究发展计划(2002AA414110;2002AA414060)

摘　　要：针对分割STL模型时需要对分割截面进行三角剖分的问题,提出STL模型分割截面的Delaunay三角剖分算法.将截面轮廓围成区域分成一个或多个区域单元,分别进行Delaunay三角剖分,并按STL模型标准拾取三角形.文中算法不用对分割截面轮廓进行复杂的凸划分和多轮廓的单轮廓化处理,提高了STL模型分割截面的三角剖分效率,尤其适合对具有复杂型腔的STL模型的截面进行三角剖分.应用实例表明:文中算法是正确有效的,具有实用价值.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.

关 键 词：STL模型 三角剖分 快速成型 

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