Finding the shortest watchman route in a simple polygon

  • Svante Carlsson
  • Håkan Jonsson
  • Bengt J. Nilsson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 762)

Abstract

We present the first polynomial-time algorithm that finds the shortest route in a simple polygon such that all points of the polygon is visible from some point on the route. This route is sometimes called the shortest watchman route, and it does not allow any restrictions on the route or on the simple polygon. Our algorithm runs in O(n3) time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Aggarwal. The Art Gallery Theorem: Its Variations, Applications and Algorithmic Aspects. PhD thesis, Johns Hopkins University, 1984.Google Scholar
  2. [2]
    S. Carlsson, B.J. Nilsson, S. Ntafos. Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. International Journal of Computational Geometry and Applications, 3(1):85–105, 1993.CrossRefGoogle Scholar
  3. [3]
    B. Chazelle. Triangulating a Simple Polygon in Linear Time. In Proc. 31st Symposium on Foundations of Computer Science, pages 220–230, 1990.Google Scholar
  4. [4]
    W. Chin, S. Ntafos. Shortest Watchman Routes in Simple Polygons. Discrete and Computational Geometry, 6(1):9–31, 1991.Google Scholar
  5. [5]
    L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan. Linear Time Algorithms for Visibility and Shortest Path Problems inside Triangulated Simple Polygons. Algorithmic, 2:209–233, 1987.CrossRefGoogle Scholar
  6. [6]
    D.T. Lee, A.K. Lin. Computational Complexity of Art Gallery Problems. IEEE Transactions on Information Theory, IT-32:276–282, 1986.CrossRefGoogle Scholar
  7. [7]
    D.T. Lee, F.P. Preparata. An Optimal Algorithm for Finding the Kernel of a Polygon. Journal of the ACM, 26:415–421, 1979.CrossRefGoogle Scholar
  8. [8]
    J.S.B. Mitchell, E.L. Wynters. Watchman Routes for Multiple Guards. In Proc. 3rd Canadian Conference on Computational Geometry, pages 126–129, 1991.Google Scholar
  9. [9]
    B.J. Nilsson, S. Schuierer. Shortest m-Watchmen Routes for Histograms: The MinMax Case. Technical Report “Bericht 43”, Institut für Informatik, Universität Freiburg, Germany, January 1992. An extended abstract was presented at the 4th International Conference on Computing and Information, pages 31–34, 1992.Google Scholar
  10. [10]
    B.J. Nilsson, D. Wood. Watchmen Routes in Spiral Polygons. Technical Report LU-CS-TR:90-55, Dept. of Computer Science, Lund University, 1990. An extended abstract of a preliminary version was presented at the 2nd Canadian Conference on Computational Geometry, pages 269–272, 1990.Google Scholar
  11. [11]
    X.-H. Tan, T. Hirata, Y. Inagaki. An Incremental Algorithm for Constructing Shortest Watchman Routes. In Proc. ISA '91 Algorithms, pages 163–175. Springer Verlag, Lecture Notes in Computer Science 557, 1991.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Svante Carlsson
    • 1
  • Håkan Jonsson
    • 1
  • Bengt J. Nilsson
    • 2
  1. 1.Department of Computer ScienceLuleå University of TechnologyLuleåSweden
  2. 2.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations