Qiao Yujing, Lv Ning, Ouyang Xuefeng
School of Mechanical Engineering, Yangzhou Polytechnic College, Yangzhou 225009, China.
School of Automation, Harbin University of Science and Technology, Harbin 150080, China.
Micromachines (Basel). 2022 Aug 5;13(8):1262. doi: 10.3390/mi13081262.
The quality of the filling algorithm in additive manufacturing directly affects the strength of the part. The commonly used 3D printing filling algorithm at this stage is the classic filling algorithm. The density of each part in the filling region is the same, and there is a cavity structure in the transverse direction, which makes the strength of the part in the transverse direction lower. Therefore, this paper proposed a new filling algorithm-variable density filling algorithm based on Delaunay triangulation. First, we performed concave-polygon-convex decomposition on the filling area to form printing sub-regions; then, the filling density value was set according to the required intensity of each region, and we used the Poisson disk sampling algorithm to generate the filling point set. Finally, Delaunay triangulation was performed on the generated point set to generate filled traces. The comparison with the two commonly used classical filling algorithms proves that the algorithm can improve the strength of the part to a certain extent, and the printing time and the consumption of consumables will not increase significantly.
增材制造中填充算法的质量直接影响零件的强度。现阶段常用的3D打印填充算法是经典填充算法。填充区域内各部分的密度相同，横向存在空洞结构，这使得零件横向强度较低。因此，本文提出了一种基于德劳内三角剖分的新型填充算法——变密度填充算法。首先，对填充区域进行凹多边形凸分解，形成打印子区域；然后，根据各区域所需强度设置填充密度值，并使用泊松盘采样算法生成填充点集。最后，对生成的点集进行德劳内三角剖分，生成填充轨迹。与两种常用的经典填充算法的比较证明，该算法能在一定程度上提高零件强度，且打印时间和耗材消耗不会显著增加。
