快速成型中STL模型直接切片新算法研究 |
| |
引用本文: | 田仁强,张义飞.快速成型中STL模型直接切片新算法研究[J].机床与液压,2019,47(16):55-59. |
| |
作者姓名: | 田仁强 张义飞 |
| |
作者单位: | 天津科技大学机械工程学院,天津,300222;天津科技大学机械工程学院,天津,300222 |
| |
摘 要: | 提出基于快速成型中STL模型直接切片新算法。读取二进制STL模型信息,创建三角面片矩阵;采用二分查找算法实现三角面片与切平面相交分组;再对每一组中三角面片与相交切平面求其交点获得相交线段,去除相交线段间的冗余节点;最后用深度优先搜索算法对切平面中相交线段优化创建轮廓线路径。此算法避免了切平面与三角面片位置关系的判断和建立三角面片之间拓扑信息关系,在切片耗时上具有明显的优势。
|
关 键 词: | 快速成型 STL模型 二分查找 切片算法 深度优先搜索 |
A New Algorithm for Direct Slicing of STL Model in Rapid Prototyping |
| |
Abstract: | 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. |
| |
Keywords: | Rapid prototyping STL model Binary search Slicing algorithm Depth first search |
本文献已被 CNKI 万方数据 等数据库收录! |
| 点击此处可从《机床与液压》浏览原始摘要信息 |
|
点击此处可从《机床与液压》下载全文 |
|