Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling

Abstract We study the problem of finding shortest tours/paths for “lawn mowing” and “milling” problems: Given a region in the plane, and given the shape of a “cutter” (typically, a circle or a square), find a shortest tour/path for the cutter such that every point within the region is covered by the cutter at some position along the tour/path. In the milling version of the problem, the cutter is constrained to stay within the region. The milling problem arises naturally in the area of automatic tool path generation for NC pocket machining. The lawn mowing problem arises in optical inspection, spray painting, and optimal search planning. Both problems are NP-hard in general. We give efficient constant-factor approximation algorithms for both problems. In particular, we give a (3+e) -approximation algorithm for the lawn mowing problem and a 2.5-approximation algorithm for the milling problem. Furthermore, we give a simple 6 5 -approximation algorithm for the TSP problem in simple grid graphs, which leads to an 11 5 -approximation algorithm for milling simple rectilinear polygons.

[1]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[2]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[3]  Joseph S. B. Mitchell,et al.  Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.

[4]  Pravin M. Vaidya,et al.  Geometry helps in matching , 1989, STOC '88.

[5]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[6]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[7]  Joseph S. B. Mitchell,et al.  Bicriteria Shortest Path Problems in the Plane ( extended abstract ) , 2022 .

[8]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[9]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[11]  Christopher Umans,et al.  Hamiltonian cycles in solid grid graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[12]  Esther M. Arkin,et al.  Optimization Problems Related to Zigzag Pocket Machining , 1996, SODA '96.

[13]  Prabhakar Raghavan,et al.  The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection , 1994, ISAAC.

[14]  Esther M. Arkin,et al.  Computing a shortest k-link path in a polygon , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[15]  Francis Y. L. Chin,et al.  Finding the Medial Axis of a Simple Polygon in Linear Time , 1995, ISAAC.

[16]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[19]  Esther M. Arkin,et al.  Optimal covering tours with turn costs , 2001, SODA '01.

[20]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[21]  Gerhard J. Woeginger,et al.  Angle-Restricted Tours in the Plane , 1997, Comput. Geom..

[22]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[23]  Esther M. Arkin,et al.  The Lawnmower Problem , 1993, Canadian Conference on Computational Geometry.

[24]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[25]  Sándor P. Fekete,et al.  Traveling the Boundary of Minkowski Sums , 1998, Inf. Process. Lett..