SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition

DOI10.1142/S0218195921500096zbMath1496.68353arXiv2109.01769MaRDI QIDQ5104667

Narasimha Boddeti, Prashant K. Gupta, Yiran Guo, Bala Krishnamoorthy

Publication date: 15 September 2022

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.01769

zbMATH Keywords

domain decompositionspace-filling curve3D printingcontinuous tool path

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• The Euclidean traveling salesman problem is NP-complete
• Approximation algorithms for lawn mowing and milling
• Worst-case analysis of a new heuristic for the travelling salesman problem
• Angle-restricted tours in the plane.
• Approximate convex decomposition of polygons
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• A Multilevel Approach to the Travelling Salesman Problem
• Hamilton Paths in Grid Graphs
• The Angular-Metric Traveling Salesman Problem
• Minimization and maximization versions of the quadratic travelling salesman problem
• Optimal Covering Tours with Turn Costs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition