發(fā)布時間：2018-09-07 17:46

【摘要】：為了提高3D打印技術(shù)中三維模型的打印效率,減少打印材料耗費,縮短打印時間,提出了一種全局最優(yōu)的模型分割與打包算法。首先,將給定模型分割為若干金字塔形狀的分塊。然后利用一種改進的禁忌搜索算法尋找最優(yōu)打包方案,盡可能地減少支撐材料的體積,根據(jù)分塊體積給出利于全局優(yōu)化的初始解,并通過控制鄰域生成規(guī)則以及候選解集,使得搜索更加高效并大幅提高尋優(yōu)速度。最后,將打印成型的各部件拼合成整體。實驗結(jié)果表明:生成的打包方案節(jié)省了14%~38%的打印時間,節(jié)省了21%-46%的打印材料。該方法模型分割產(chǎn)生的分塊個數(shù)少、打包高效合理,不僅有效地提高打印效率,還減少了打印時間和支撐材料消耗。
[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.
【作者單位】： 西北大學信息科學與技術(shù)學院;
【基金】：國家自然科學基金面上項目(No.61373117,No.61305032)
【分類號】：TP391.73

【相似文獻】

相關期刊論文 前10條

1 汪嘉楊;李祚泳;倪長健;熊建秋;;基于混合禁忌搜索算法的水位流量關系擬合[J];系統(tǒng)工程;2006年06期

2 郭宇;茹海鵬;;用禁忌搜索算法求解單機總加權(quán)拖期最小問題[J];科技信息(科學教研);2008年18期

3 蔣泰;楊海s，

本文編號：2228972