Optimal covering tours with turn costs

@article{Arkin2001OptimalCT,
  title={Optimal covering tours with turn costs},
  author={E. Arkin and M. A. Bender and E. Demaine and S. Fekete and Joseph S. B. Mitchell and S. Sethia},
  journal={ArXiv},
  year={2001},
  volume={cs.DS/0309014}
}
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 not only on the length of the tour but also on the number of turns. These problems arise naturally in manufacturing applications of computational geometry to automatic tool path generation and automatic inspection systems, as well as arc… Expand
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
The Rectilinear κ-Bends TSP
The Rectilinear k-Bends TSP
Fpt-Algorithms for Minimum-Bends Tours
On Covering Points with Minimum Turns
  • M. Jiang
  • Mathematics, Computer Science
  • Int. J. Comput. Geom. Appl.
  • 2015
The traveling salesman problem on grids with forbidden neighborhoods
A transformation for the mixed general routing problem with turn penalties
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
The Directed Rural Postman Problem with Turn Penalties
On the Computational Geometry of Pocket Machining
  • M. Held
  • Computer Science
  • Lecture Notes in Computer Science
  • 1991
Combinatorial optimization
Angle-restricted tour s in the plane.Comput
  • Geom. Theory Appl
  • 1997