Computing a shortest watchman path in a simple polygon in polynomial-time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 955, Issue , 1995, Pages 122-134

  Carlsson, Svante ^a   Jonsson, Håkan ^a  

^a LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; DATA STRUCTURES; GEOMETRY; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

POLYGONAL CHAINS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SIMPLE POLYGON;

ALGORITHMS;

EID: 84958060434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60220-8_56     Document Type: Conference Paper

References (21)

1. A. Aggarwal. The Art Gallery Theorem: Its variations, applications and algorithmic aspects. PhD thesis, John Hopkins University, 1984.
2. B. K. Bhattacharya, A. Mukhopadhyay, and G. T. Toussaint. A linear time alo-gorithm for computing the shortest line segment from which a polygon is weakly externally visible. In Proceedings of 2nd WADS, pages 412-424. Springer-Verlag, 1991.
3. B. Chazelle. Triangulating a simple polygon in linear time. In Proceedings of the 31th Symposium on Foundations of Computer Science, pages 220-230, 1990.
4. W. Chin and S. Ntafos Optimum watchman routes. Inform. Process. Lett., 28:39-44, 1988.
5. W. Chin and S. Ntafos. Shortest watchman routes in simple polygons. Disc. Comp. Geometry, 6:9-31, 1991.
6. W. Chin and S. Ntafos. The zookeeper route problem. Inform. Sci., 63:245-259, 1992.
7. J. Czyzowicz, P. Egyed, H. Everett, D. Rappaport, T. Shermer, D. Souvaine, G. Toussaint, and J. Urrutia. The aquarium keeper's problem. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pages 459-464, 1991.
8. G. Das, P. J. Heffernan, and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), pages 119-130. Springer-Verlag, 1994. LNCS 824.
9. G. Das and G. Narasimhan. Optimal linear-time algorithm for the shortest illuminating line segment in a polygon. In Proceedings of the 10th Annual Symposium on Computational Geometry, pages 259-266, 1994.
10. J. Forsberg, U. Larsson, and A. Wernersson. On mobile robot navigation in cluttered rooms using the range weighted hough transform. IEEE Robotics and Automation Society Magazine, 1995. Department of Computer Science and Electrical Engineering, Lulea, University of Technology. Accepted for publication in the special issue on mobile robots.
11. L. Guibas, J. Hersberger, D. Leven, M. Sharir, and R. Tarjan. Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
12. J. Hersberger and J. Snoeyink. An efficient solution to the zookeeper's problem. In Proceedings of the 6th Canadian Conference on Computational Geometry, pages 104-109, 1994. U. of Saskatchewan, Saskatoon, Ontario.
13. J. Hersberger and S. Suri. A pedestrian approach to ray shooting: Shoot a ray, take a walk. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 54-63, 1993.
14. J.-C. Latombe, editor. Robot Motion Planning. Kluwer Academic Publishers, Norwell, MA, 1991.
15. D.T. Lee and A.K. Lin. Computational complexity of art gallery problems. IEEE Trans. Info. Theory, 32(2):276-282, 1986.
16. B. Nilsson. Guarding Art Galleries; Methods for Mobile Guards. PhD thesis, Lund University, Sweden, 1995.
17. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford univ. press, 1987. ISBN 0-19-503965-3.
18. J.-R. Sack and S. Suri. An optimal algorithm for detecting weak visibility. IEEE Trans. Comput., 39:1213-1219, 1990.
19. T. Shermer. Recent results in art galleries. In Proceedings of the IEEE, pages 1384-1399, September 1992.
20. X.-H. Tan, T. Hirata, and Y. Inagaki. An incremental algorithm for constructing shortest watchman routes. In Proceedings of ISA'91, pages 163-175. Springer-Verlag, 1991. LNCS 557.
21. X.-H. Tan, T. Hirata, and Y. Inagaki. Constructing shortest watchman routes by divide-and-conquer. In Proceedings of ISAAC'93, pages 68-77. Springer-Verlag, 1993. LNCS 762.