增材制造中复杂区域的分割填充扫描算法
发布时间:2018-10-05 14:35
【摘要】:针对增材制造技术中复杂分层区域的填充扫描问题,提出一种区域分割扫描算法。首先,识别内轮廓上区域分割点及所有轮廓上的分割交点,并按顺序存储、更新轮廓数据;然后,利用提出的区域轮廓搜索算法遍历新的轮廓数据,实现了对独立填充扫描区域的快速提取;考虑3D打印机的运动学特性,给出了以打印时间最短为目标的最优填充扫描方向计算方法,完成了对打印区域的快速填充。所提算法可将含有孔、岛屿等内轮廓特征的复杂打印平面分割为若干个可以连续打印成型的子区域,减少了打印喷头跨越内孔等非打印区域时的抬头次数,结合优化后的扫描方向,能有效提高打印效率。通过算例验证了所提算法的有效性和正确性。
[Abstract]:To solve the problem of filling and scanning complex layered regions in material augmentation manufacturing technology, a region segmentation scanning algorithm is proposed. First, the segmentation points of the region on the inner contour and the segmentation points on all the contours are identified, and the contour data is stored sequentially to update the contour data. Then, the new contour data is traversed by using the proposed region contour search algorithm. The fast extraction of the independent filling scan region is realized, and considering the kinematics characteristics of the 3D printer, the method of calculating the optimal filling scan direction with the shortest printing time is given, and the fast filling of the printing area is completed. The proposed algorithm can divide the complex printing plane with inner contour features such as holes and islands into several sub-regions that can be continuously printed, thus reducing the number of times when the printing nozzle crosses the non-print area such as the inner hole. Combined with the optimized scanning direction, the printing efficiency can be improved effectively. An example is given to verify the validity and correctness of the proposed algorithm.
【作者单位】: 大连理工大学工业装备结构分析国家重点实验室/汽车工程学院;
【基金】:国家自然科学基金资助项目(11272077,51575086) 中央高校基本科研业务费专项资助项目(DUT16LAB17)~~
【分类号】:TP391.73
本文编号:2253767
[Abstract]:To solve the problem of filling and scanning complex layered regions in material augmentation manufacturing technology, a region segmentation scanning algorithm is proposed. First, the segmentation points of the region on the inner contour and the segmentation points on all the contours are identified, and the contour data is stored sequentially to update the contour data. Then, the new contour data is traversed by using the proposed region contour search algorithm. The fast extraction of the independent filling scan region is realized, and considering the kinematics characteristics of the 3D printer, the method of calculating the optimal filling scan direction with the shortest printing time is given, and the fast filling of the printing area is completed. The proposed algorithm can divide the complex printing plane with inner contour features such as holes and islands into several sub-regions that can be continuously printed, thus reducing the number of times when the printing nozzle crosses the non-print area such as the inner hole. Combined with the optimized scanning direction, the printing efficiency can be improved effectively. An example is given to verify the validity and correctness of the proposed algorithm.
【作者单位】: 大连理工大学工业装备结构分析国家重点实验室/汽车工程学院;
【基金】:国家自然科学基金资助项目(11272077,51575086) 中央高校基本科研业务费专项资助项目(DUT16LAB17)~~
【分类号】:TP391.73
【相似文献】
相关期刊论文 前10条
1 谢尔锐·杰瓦德;约格希·阿加沃;徐朝寅;;扫描算法中部份枚举法的效果[J];成都科技大学学报;1985年02期
2 轩志远;陆介平;方伍元;;数据整合中交互过滤扫描算法[J];江苏科技大学学报(自然科学版);2006年03期
3 葛红宇;张建华;;模腔快速制造的分区扫描算法研究[J];江苏工业学院学报;2005年04期
4 任佳;雷虎;;一种新型矢栅转换的平行线扫描算法[J];科技信息(学术研究);2008年09期
5 姜建德,徐维朴,郑南宁;一种非线性运动自适应倍行扫描算法[J];西安交通大学学报;1997年09期
6 蒋文沛;KMP扫描算法的改进[J];广西科学院学报;2001年03期
7 王成;曾晓雁;;激光三维雕刻中扫描算法的研究[J];工程图学学报;2007年04期
8 莫则尧,傅连祥,阳述林;非结构网格上求解中子输运方程的并行流水线S_n扫描算法[J];计算机学报;2004年05期
9 李文杰;陈刚;高思聪;王际红;吕晓斌;陈晓清;;基于空间扫描算法的四川省烟草病虫害高发区检测[J];福建电脑;2013年07期
10 林毅,金烨,马登哲,严隽琪;正规网格等值线的虚路径扫描算法[J];计算机工程与应用;2001年13期
相关硕士学位论文 前1条
1 宋慧娟;区域目标快速捕获扫描算法研究[D];西安工业大学;2013年
,本文编号:2253767
本文链接:https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2253767.html