Optimal Covering Tours with Turn Costs
Abstract
We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it sweeps out a specified region (``pocket''), in order to minimize a cost that depends mainly on the number of em turns. These problems arise naturally in manufacturing applications of computational geometry to automatic tool path generation and automatic inspection systems, as well as arc routing (``postman'') problems with turn penalties. We prove the NP-completeness of minimum-turn milling and give efficient approximation algorithms for several natural versions of the problem, including a polynomial-time approximation scheme based on a novel adaptation of the m-guillotine method.
Cite
@article{arxiv.cs/0309014,
title = {Optimal Covering Tours with Turn Costs},
author = {Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Sandor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia},
journal= {arXiv preprint arXiv:cs/0309014},
year = {2007}
}
Comments
36 pages, 19 figures, 2 tables, Latex; to appear in SIAM Journal on Computing. New version contains more technical details in Sections 4.1, 5.1, 5.2, 5.5, four more figures, four more pages, as well as numerous smaller changes