APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING

DOI10.1142/S0218195901000535MaRDI QIDQ4682171zbMATH OpenOpenAlexFDO

Authors Sunil Arya, Siu-Wing Cheng, David M. Mount

Publication date 10 June 2005

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

Full work available at URL https://doi.org/10.1142/s0218195901000535

zbMATH Keywords

approximation algorithmsset coverquadtreesMilling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for lawn mowing and milling
• On the computational geometry of pocket machining
• Optimal Covering Tours with Turn Costs
• Optimal covering tours with turn costs
• Optimization problems related to zigzag pocket machining

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands
• Automatic cutter selection and optimal cutter path generation for prismatic parts
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Optimization problems related to zigzag pocket machining

Cited in

(5)

• Quadtree, ray shooting and approximate minimum weight Steiner triangulation
• Tool selection in three-axis rough machining
• Approximation algorithms for lawn mowing and milling
• Experimental evaluation of algorithms for the orthogonal milling problem with turn costs
• Milling a graph with turn costs: a parameterized complexity perspective

This page was built for publication: APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682171)