Approximation algorithms for lawn mowing and milling

Computational Geometry: Theory and Applications

Volumn 17, Issue 1-2, 2000, Pages 25-50

  Arkin, Esther M ^a   Fekete, Sándor P ^b   Mitchell, Joseph S B ^a  

^a USA   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Computational geometry; Geometric optimization; Lawn mowing; Milling; NC machining; NP completeness; Traveling salesman problem (TSP)

Indexed keywords

EID: 0037894062     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00015-8     Document Type: Article

References (26)

1. E.M. Arkin, M.A. Bender, E.D. Demaine, S.P. Fekete, J.S.B. Mitchell, S. Sethia, Optimal covering tours with turn costs, Manuscript, 2000.
2. Arkin E.M., Fekete S.P., Mitchell J.S.B. The lawnmower problem. Proceedings of the 5th Canadian Conference on Computational Geometry. 1993;461-466.
3. Arkin E.M., Hassin R. Approximation algorithms for the geometric covering salesman problem. Discrete Appl. Math. 55:1994;197-218.
4. Arkin E.M., Held M., Smith C.L. Optimization problems related to zigzag pocket machining. Algorithmica. 26:2000;197-236.
5. Arkin E.M., Mitchell J.S.B., Piatko C.D. Bicriteria shortest path problems in the plane. Proceedings of the 3rd Canadian Conference on Computational Geometry. 1991;153-156.
6. Arora S. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science. 1996;2-12.
7. Arora S. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. J. ACM. 45:(5):1998;1-30.
8. Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6:1991;485-524.
9. Chin F., Snoeyink J., Wang C.-A. Finding the medial axis of a simple polygon in linear time. Proceedings of the 6th Annual International Symposium on Algorithms and Computing (ISAAC 95). Lecture Notes in Computer Science. 1004:1995;382-391 Springer, New York.
10. Fekete S.P., Pulleyblank W.R. Traveling the boundary of Minkowski sums. Inform. Process. Lett. 66:1998;171-174.
11. Fekete S.P., Woeginger G.J. Angle-Restricted Tours in the plane. Computational Geometry. 8:1997;195-218.
12. Grigni M., Koutsoupias E., Papadimitriou C. An approximation scheme for planar graph TSP. Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science. 1995;640-645.
13. Held M. On the Computational Geometry of Pocket Machining. 1991;Springer, New York.
14. Itai A., Papadimitriou C.H., Szwarcfiter J.L. Hamilton paths in grid graphs. SIAM J. Comput. 11:1982;676-686.
15. Iwano K., Raghavan P., Tamaki H. The traveling cameraman problem, with applications to automatic optical inspection. Proceedings of the 5th Annual International Symposium on Algorithms and Computing (ISAAC 1994). Lecture Notes in Computer Science. 1994;Springer, New York.
16. Johnson D.S., Papadimitriou C.H. Computational complexity and the traveling salesman problem. Lawler E., Lenstra J., Rinnooy Kan A., Shmoys D. The Traveling Salesman Problem. 1985;68-74 Wiley, New York.
17. Mata C., Mitchell J.S.B. Approximation algorithms for geometric tour and network design problems. Proceedings of the 11th Annual ACM Symposium on Computational Geometry. 1995;360-369.
18. Mitchell J.S.B. Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k -MST problem. Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms. 1996;402-408.
19. Mitchell J.S.B. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k -MST, and related problems. SIAM J. Comput. 28:1999;1298-1309.
20. Mitchell J.S.B., Piatko C., Arkin E.M. Computing a shortest k -link path in a polygon. Proceedings of the 33rd Annual IEEE Symposium on the Foundations of Computer Science. 1992;573-582.
21. Ntafos S. Watchman routes under limited visibility. Computational Geometry. 1:(3):1992;149-170.
22. Preparata F.P., Shamos M.I. Computational Geometry: An Introduction. 1985;Springer, New York.
23. Rao S.B., Smith W.D. Approximating geometrical graphs via "spanners" and "banyans" Proceedings of the 30th ACM Symposium on Theory of Computing. 1998;540-550.
24. Umans C., Lenhart W. Hamiltonian cycles in solid grid graphs. Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science. 1997;496-507.
25. Vaidya P.M. Geometry helps in matching. SIAM J. Comput. 18:1989;1201-1225.
26. Vaidya P.M. Approximate minimum weight matching on points in k -dimensional space. Algorithmica. 4:1989;569-583.