Advertisement

Linear-Time 2-Approximation Algorithm for the Watchman Route Problem

  • Xuehou Tan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

Abstract

Given a simple polygon P of n vertices, the watchman route problem asks for a shortest (closed) route inside P such that each point in the interior of P can be seen from at least one point along the route. We present a simple, linear-time algorithm for computing a watchman route of length at most 2 times that of the shortest watchman route. The best known algorithm for computing a shortest watchman route takes O(n 4 log n) time, which is too complicated to be suitable in practice.

This paper also involves an optimal O(n) time algorithm for computing the set of so-called essential cuts, which are the line segments inside the polygon P such that any route visiting them is a watchman route. It solves an intriguing open problem by improving the previous O(n log n) time result, and is thus of interest in its own right.

Keywords

Short Path Line Segment Intersection Point Simple Polygon Left Endpoint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alsuwaiyel, M.H., Lee, D.T.: Finding an approximate minimum-link visibility path inside a simple polygon. Inform. Process. Lett. 55, 75–79 (1995)MATHCrossRefMathSciNetGoogle Scholar
  2. Carlsson, S., Jonsson, H., Nilsson, B.J.: Approximating the shortest watchman route in a simple polygon, Technical report, Lund University, Sweden (1997)Google Scholar
  3. Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. Discrete Comput. Geom. 22, 377–402 (1999)MATHCrossRefMathSciNetGoogle Scholar
  4. Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)MATHCrossRefMathSciNetGoogle Scholar
  5. Das, G., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Comput. Geom. Theory Appl. 7, 37–57 (1997)MATHMathSciNetGoogle Scholar
  6. Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proc. 35th Annu. ACM Sympos. Theory Comput., pp. 473–482 (2003)Google Scholar
  7. Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons. Algorithmica 2, 209–233 (1987)MATHCrossRefMathSciNetGoogle Scholar
  8. Heffernan, P.J.: An optimal algorithm for the two-guard problem. Int. J. Comput. Geom. Appl. 6, 15–44 (1996)MATHCrossRefMathSciNetGoogle Scholar
  9. O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1993)Google Scholar
  10. Tan, X.: Fast computation of shortest watchman routes in simple polygons. IPL 77, 27–33 (2001)MATHCrossRefGoogle Scholar
  11. Tan, X.: Approximation algorithms for the watchman route and zoo-keeper’s problems. Discrete Applied Math. 136, 363–376 (2004)MATHCrossRefGoogle Scholar
  12. Tan, X., Hirata, T., Inagaki, Y.: Corrigendum to an incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 9, 319–323 (1999)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xuehou Tan
    • 1
  1. 1.Tokai UniversityNumazuJapan

Personalised recommendations