3D打印中的模型分割与打包
发布时间：2018-09-07 17:46
【摘要】：为了提高3D打印技术中三维模型的打印效率,减少打印材料耗费,缩短打印时间,提出了一种全局最优的模型分割与打包算法。首先,将给定模型分割为若干金字塔形状的分块。然后利用一种改进的禁忌搜索算法寻找最优打包方案,尽可能地减少支撑材料的体积,根据分块体积给出利于全局优化的初始解,并通过控制邻域生成规则以及候选解集,使得搜索更加高效并大幅提高寻优速度。最后,将打印成型的各部件拼合成整体。实验结果表明:生成的打包方案节省了14%~38%的打印时间,节省了21%-46%的打印材料。该方法模型分割产生的分块个数少、打包高效合理,不仅有效地提高打印效率,还减少了打印时间和支撑材料消耗。
[Abstract]:In order to improve the printing efficiency of 3D models, reduce the cost of printing materials and shorten the printing time, a global optimal model segmentation and packaging algorithm is proposed. First, the given model is divided into blocks with several pyramid shapes. Then, an improved Tabu search algorithm is used to find the optimal packing scheme, which can reduce the volume of the supporting material as much as possible. According to the block volume, the initial solution is given, and the rules of neighborhood generation and the candidate solution set are obtained by controlling the neighborhood. Make search more efficient and greatly improve the speed of optimization. Finally, the parts of the printing molding are assembled into a whole. The experimental results show that the packing scheme can save 14% of printing time and 21%-46% of printing material. This method not only improves the printing efficiency, but also reduces the printing time and the consumption of supporting materials.
【作者单位】： 西北大学信息科学与技术学院;
【基金】：国家自然科学基金面上项目(No.61373117,No.61305032)
【分类号】：TP391.73
[Abstract]:In order to improve the printing efficiency of 3D models, reduce the cost of printing materials and shorten the printing time, a global optimal model segmentation and packaging algorithm is proposed. First, the given model is divided into blocks with several pyramid shapes. Then, an improved Tabu search algorithm is used to find the optimal packing scheme, which can reduce the volume of the supporting material as much as possible. According to the block volume, the initial solution is given, and the rules of neighborhood generation and the candidate solution set are obtained by controlling the neighborhood. Make search more efficient and greatly improve the speed of optimization. Finally, the parts of the printing molding are assembled into a whole. The experimental results show that the packing scheme can save 14% of printing time and 21%-46% of printing material. This method not only improves the printing efficiency, but also reduces the printing time and the consumption of supporting materials.
【作者单位】： 西北大学信息科学与技术学院;
【基金】：国家自然科学基金面上项目(No.61373117,No.61305032)
【分类号】：TP391.73
【相似文献】
相关期刊论文 前10条
1 汪嘉杨;李祚泳;倪长健;熊建秋;;基于混合禁忌搜索算法的水位流量关系拟合[J];系统工程;2006年06期
2 郭宇;茹海鹏;;用禁忌搜索算法求解单机总加权拖期最小问题[J];科技信息(科学教研);2008年18期
3 蒋泰;杨海s，
本文编号：2228972
本文链接：https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2228972.html
