Fast computation of shortest watchman routes in simple polygons

Information Processing Letters

Volumn 77, Issue 1, 2001, Pages 27-33

  Tan, Xuehou ^a  

^a TOKAI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

POLYGONS; WATCHMAN ROUTES;

COMPUTATIONAL GEOMETRY;

EID: 0035155541     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00146-0     Document Type: Article

References (10)

1. Alsuwaiyel M.H., Lee D.T. Finding an approximate minimum-link visibility path inside a simple polygon. Inform. Process. Lett. Vol. 55:1995;75-79.
2. Carlsson S., Jonsson H., Nilsson B.J. Finding the shortest watchman route in a simple polygon. Lecture Notes in Comput. Sci. Vol. 762:1993;58-67 Springer, Berlin.
3. Chin W.P., Ntafos S. Optimum watchman routes. Inform. Process. Lett. Vol. 28:1988;39-44.
4. Chin W.P., Ntafos S. Shortest watchman routes in simple polygons. Discrete Comput. Geom. Vol. 6:1991;9-31.
5. Czyzowicz J., Egyed P., Everett H., Rappaport D., Shermer T., Souvaine D., Toussaint G., Urrutia J. The aquarium keeper's problem. Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms. 1991;459-464.
6. Hammar M., Nilsson B.J. Concerning the time bounds of existing shortest watchman route algorithms. Proc. FCT'97. Lecture Notes in Comput. Sci. Vol. 1279:1997;210-221 Springer, Berlin.
7. Nilsson B. Guarding art galleries; Methods for mobile guards. Ph.D. Thesis:1995;Lund University, Sweden.
8. Tan X., Hirata T., Inagaki Y. An incremental algorithm for constructing shortest watchman routes. Internat. J. Comput. Geom. Appl. Vol. 3:1993;351-365.
9. Tan X., Hirata T. Constructing shortest watchman routes by divide-and-conquer. Proc. ISAAC'93. Lecture Notes in Comput. Sci. Vol. 762:1993;68-77 Springer, Berlin.
10. Tan X., Hirata T., Inagaki Y. Corrigendum to "An incremental algorithm for constructing shortest watchman routes" Internat. J. Comput. Geom. Appl. Vol. 3:1999;319-323.