Theory Appl., to appear. Being a generalisation of the well known Travelling Salesman Problem, the lawn mower problem is NP hard, so one cannot hope to find an efficient algorithm that computes an optimal tour for any input Y . However, the scenario of rendezvous search with a known distance d and search radius r is less general, so we do not have to deal with all the difficulties of the lawn mower problem. Approximation algorithms for lawn mowing and milling . E. Arkin, S. P. Fekete, and J. S. B.Mitchell.
Approximation algorithms for lawnmowing and milling .
The second method uses rings as building blocks, following a natural ring decomposition from the straight skeleton. The third method uses seamless convex polygons as building blocks, allowing us to optimize the number or length of seams in the overall folding. We thank Jin Akiyama for introducing us to the wrapping problem. E. M. Arkin, S. P. Fekete, and J. S. B. Mitchell. Approximation algorithms for lawn mowing and milling .