Approximation algorithms for lawn mowing and milling
Top Cited Papers
- 1 October 2000
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 17 (1-2) , 25-50
- https://doi.org/10.1016/s0925-7721(00)00015-8
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Optimization Problems Related to Zigzag Pocket MachiningAlgorithmica, 2000
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related ProblemsSIAM Journal on Computing, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Traveling the boundary of Minkowski sumsInformation Processing Letters, 1998
- Angle-Restricted Tours in the planeComputational Geometry, 1997
- Finding the medial axis of a simple polygon in linear timePublished by Springer Nature ,1995
- On the computational geometry of pocket machining: Martin Held, author Springer-Verlag, © 1991 xii + 178 pp. $21.00Journal of Manufacturing Systems, 1994
- Approximation algorithms for the geometric covering salesman problemDiscrete Applied Mathematics, 1994
- Watchman routes under limited visibilityComputational Geometry, 1992
- Geometry Helps in MatchingSIAM Journal on Computing, 1989