Minimum-link watchman tours

Information Processing Letters

Volumn 86, Issue 4, 2003, Pages 203-207

  Arkin, Esther M ^a   Mitchell, Joseph S B ^a   Piatko, Christine D ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b APL   (United States)

Author keywords

Approximation algorithms; Computational geometry; Link distance; NP complete; Polygons; Watchman route

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS;

DATA PROCESSING;

EID: 0037475189     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00502-1     Document Type: Article

References (13)

1. Alsuwaiyel M.H., Lee D.T. Minimal link visibility paths inside a simple polygon. Comput. Geom. Theory Appl. 3:(1):1993;1-25.
2. Alsuwaiyel M.H., Lee D.T. Finding an approximate minimum-link visibility path inside a simple polygon. Inform. Process. Lett. 55:(2):1995;75-79.
3. Carlsson S., Jonsson H., Nilsson B.J. Finding the shortest watchman route in a simple polygon. Discrete Comput. Geom. 22:(3):1999;377-402.
4. Chin W., Ntafos S. Optimum watchman routes. Inform. Process. Lett. 28:1988;39-44.
5. Chin W.-P., Ntafos S. Shortest watchman routes in simple polygons. Discrete Comput. Geom. 6:(1):1991;9-31.
6. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
7. Ghosh S.K., Mount D.M. An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20:1991;888-910.
8. Hammar M., Nilsson B.J. Concerning the time bounds of existing shortest watchman route algorithms. Proc. 11th International Symposium on Fundamentals of Computation Theory. Lecture Notes in Comput. Sci. 1279:1997;210-221 Springer, Berlin.
9. Mata C., Mitchell J.S.B. Approximation algorithms for geometric tour and network design problems. Proc. 11th Annu. ACM Sympos. Comput. Geom. 1995;360-369.
10. Megiddo N., Tamir A. On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1:1982;194-197.
11. B.J. Nilsson, Guarding art galleries - methods for mobile guards, PhD thesis, Lund University, 1995.
12. Tan X. Fast computation of shortest watchman routes in simple polygons. Inform. Process. Lett. 77:2001;27-33.
13. Tan X., Hirata T., Inagaki Y. Corrigendum to "An incremental algorithm for constructing shortest watchman routes" Internat. J. Comput. Geom. Appl. 9:(3):1999;319-323.