检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:田仁强 张义飞 TIAN Renqiang;ZHANG Yifei(School of Mechanical Engineering,Tianjin University of Science and Technology,Tianjin 300222,China)
机构地区:[1]天津科技大学机械工程学院
出 处:《机床与液压》2019年第16期55-59,共5页Machine Tool & Hydraulics
摘 要:提出基于快速成型中STL模型直接切片新算法。读取二进制STL模型信息,创建三角面片矩阵;采用二分查找算法实现三角面片与切平面相交分组;再对每一组中三角面片与相交切平面求其交点获得相交线段,去除相交线段间的冗余节点;最后用深度优先搜索算法对切平面中相交线段优化创建轮廓线路径。此算法避免了切平面与三角面片位置关系的判断和建立三角面片之间拓扑信息关系,在切片耗时上具有明显的优势。A new direct slicing algorithm based on STL model in rapid prototyping was proposed.The binary STL model information was read and the triangular facet matrix was created;the binary search algorithm was used to achieve the intersection and grouping of triangular facets and slice planes;then,for each set of triangular facets and intersecting slice planes,the intersection point was calculated to obtain intersecting line segments,redundant nodes between intersecting line segments were removed;finally,a depth-first search algorithm was used to optimize the creation of the contour line path for intersecting line segments in the slice plane.In this algorithm,the judgment of the positional relationship between the slice plane and the triangular facet is avoided and the topological information relationship between the triangular facets is established.It has obvious advantages in the slicing time-consuming.
关 键 词:快速成型 STL模型 二分查找 切片算法 深度优先搜索
分 类 号:TH164[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33