Optimal Covering Tours with Turn Costs
<|reference_start|>Optimal Covering Tours with Turn Costs: 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.<|reference_end|>
@article{arkin2003optimal,
    title={Optimal Covering Tours with Turn Costs},
    author={Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sandor P. Fekete,
  Joseph S. B. Mitchell, and Saurabh Sethia},
    journal={arXiv preprint arXiv:cs/0309014},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0309014},
    primaryClass={cs.DS cs.CG}
}