SFCDecomp：基于区域分解的空间填充曲线多准则优化3D打印刀具路径规划
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition
摘要：
我们探索基于多个标准的3D打印问题的大型实例的刀具路径的有效优化。我们首先证明了最小转弯成本3D打印问题是NP难的，即使该区域是一个简单的多边形。我们开发了SFCDecomp，一个基于空间填充曲线的分解框架，通过独立解决这些优化子问题来有效地解决3D打印问题的大型实例。对于Buddha模型，我们的框架在169层中总共构建了799，716个节点的刀具路径，而对于Bunny模型，它在360层中构建了812，733个节点的刀具路径。基于SFCDecomp，提出了一种多目标优化的刀具路径规划方法。我们展示了我们的框架的效用，最大限度地提高或最小化相邻层之间的刀具路径边缘重叠，同时共同降低转弯成本。用最大化或最小化相邻层边缘重叠的工具路径印刷的拉伸测试样本的强度测试揭示了两类印刷品之间的拉伸强度的显著差异。
英文摘要：
We explore efficient optimization of toolpaths based on multiple criteria for large instances of 3D printing problems. We first show that the minimum turn cost 3D printing problem is NP-hard, even when the region is a simple polygon. We develop SFCDecomp, a space filling curve based decomposition framework to solve large instances of 3D printing problems efficiently by solving these optimization subproblems independently. For the Buddha model, our framework builds toolpaths over a total of 799,716 nodes across 169 layers, and for the Bunny model it builds toolpaths over 812,733 nodes across 360 layers. Building on SFCDecomp, we develop a multicriteria optimization approach for toolpath planning. We demonstrate the utility of our framework by maximizing or minimizing tool path edge overlap between adjacent layers, while jointly minimizing turn costs. Strength testing of a tensile test specimen printed with tool paths that maximize or minimize adjacent layer edge overlaps reveal significant differences in tensile strength between the two classes of prints.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
