APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING

DOI10.1142/S0218195901000535zbMath1074.68670OpenAlexW2113582058MaRDI QIDQ4682171

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

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 algorithmsquadtreesset coverMilling

Mathematics Subject Classification ID

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

Related Items (1)

Quadtree, ray shooting and approximate minimum weight Steiner triangulation

Cites Work

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

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