An approximate algorithm for solving the watchman route problem

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

Volumn 4931 LNCS, Issue , 2008, Pages 189-206

  Li, Fajie ^a,b   Klette, Reinhard ^a,b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Computational geometry; Euclidean shortest path; Rubberband algorithm; Simple polygon; Visual inspection; Watchman Route Problem

Indexed keywords

COMPUTER VISION; ROBOTICS; WATER TREATMENT PLANTS;

APPROXIMATE ALGORITHMS; COMPUTATIONAL GEOMETRY; EUCLIDEAN SHORTEST PATH; NUMERICAL PROBLEMS; ROBOT VISION; RUBBERBAND ALGORITHM; RUN-TIME; SIMPLE POLYGON; VISUAL INSPECTION; WATCHMAN ROUTE PROBLEM;

ROUTING ALGORITHMS;

EID: 49949104679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78157-8_15     Document Type: Conference Paper

References (37)

1. Alsuwaiyel, M.H., Lee, D.T.: Minimal link visibility paths inside a simple polygon. Computational Geometry 3, 1-25 (1993)
2. Alsuwaiyel, M.H., Lee, D.T.: Finding an approximate minimum-link visibility path inside a simple polygon. Information Processing Letters 55, 75-79 (1995)
3. Arkin, E.M., Mitchell, J.S.B., Piatko, C.: Minimum-link watchman tours. Technical report, University at Stony Brook (1994)
4. Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 829-876. Elsevier, Amsterdam (2000)
5. Carlsson, S., Jonsson, H., Nilsson, B.J.: Optimum guard covers and m-watchmen routes for restricted polygons. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 367-378. Springer, Heidelberg (1991)
6. Carlsson, S., Jonsson, H., Nilsson, B.J.: Optimum guard covers and m-watchmen routes for restricted polygons. Int. J. Comput. Geom. Appl. 3, 85-105 (1993)
7. Carlsson, S., Jonsson, H.: Computing a shortest watchman path in a simple polygon in polynomial-time. In: Sack, J.-R., et al. (eds.) WADS 1995. LNCS, vol. 955, pp. 122-134. Springer, Heidelberg (1995)
8. Carlsson, S., Jonsson, H., Nilsson, B.J.: Approximating the shortest watchman route in a simple polygon. Technical report, Lund University (1997)
9. Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. Discrete Computational Geometry 22, 377-402 (1999)
10. Chin, W., Ntafos, S.: Optimum watchman routes. Information Processing Letters 28, 39-44 (1988)
11. Chin, W.-P., Ntafos, S.: Shortest watchman routes in simple polygons. Discrete Computational Geometry 6, 9-31 (1991)
12. Czyzowicz, J., et al.: The aquarium keeper's problem. In: Proc. ACM-SIAM Sympos. Data Structures Algorithms, pp. 459-464 (1991)
13. Dror, M., et al.: Touring a sequence of polygons. In: Proc. STOC, pp. 473-482 (2003)
14. Gewali, L.P., et al.: Path planning in 0/1/infinity weighted regions with applications. ORSA J. Comput. 2, 253-272 (1990)
15. Gewali, L.P., Ntafos, S.: Watchman routes in the presence of a pair of convex polygons. In: Proc. Canad. Conf. Comput. Geom., pp. 127-132 (1995)
16. Hammar, M., Nilsson, B. J.: Concerning the time bounds of existing shortest watchman routes. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 210-221. Springer, Heidelberg (1997)
17. Kumar, P., Veni Madhavan, C.: Shortest watchman tours in weak visibility polygons. In: Proc. Canad. Conf. Comput. Geom., pp. 91-96 (1995)
18. Li, F., Klette, R.: Exact and approximate algorithms for the calculation of shortest paths. IMA Minneapolis, Report 2141, www.ima.umn.edu/preprints/ oct2006
19. Mata, C., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems. In: Proc. Annu. ACM Sympos. Comput. Geom., pp. 360-369 (1995)
20. Melkman, A.: On-line construction of the convex hull of a simple polygon. Information Processing Letters 25, 11-12 (1987)
21. Mitchell, J.S.B., Wynters, E.L.: Watchman routes for multiple guards. In: Proc. Canad. Conf. Comput. Geom., pp. 126-129 (1991)
22. Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633-701. Elsevier, Amsterdam (2000)
23. Moore, T.O.: Elementary General Topology. Prentice-Hall, Englewood Cliffs (1964)
24. Nilsson, B.J., Wood, D.: Optimum watchmen routes in spiral polygons. In: Proc. Canad. Conf. Comput. Geom., pp. 269-272 (1990)
25. Nilsson, B.J.: Guarding art galleries; Methods for mobile guards. Ph.D. Thesis, Lund University, Sweden (1995)
26. Ntafos, S.: The robber route problem. Inform. Process. Lett. 34, 59-63 (1990)
27. Ntafos, S.: Watchman routes under limited visibility. Comput. Geom. 1, 149-170 (1992)
28. Ntafos, S., Gewali, L.: External watchman routes. Visual Comput. 10, 474-483 (1994)
29. Sunday, D.: Algorithm 14: Tangents to and between polygons (last visit June 2006), http://softsurfer.com/Archive/algorithm.0201/
30. Tan, X., Hirata, T., Inagaki, Y.: An incremental algorithm for constructing shortest watchman route algorithms. Int. J. Comp. Geom. and Appl. 3, 351-365 (1993)
31. Tan, X., Hirata, T.: Constructing shortest watchman routes by divide-and-conquer. In: Ng, K.W., et al. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 68-77. Springer, Heidelberg (1993)
32. Tan, X., Hirata, T., Inagaki, Y.: Corrigendum to 'An incremental algorithm for constructing shortest watchman routes'. Int. J. Comp. Geom. App. 9, 319-323 (1999)
33. Tan, X.: Fast computation of shortest watchman routes in simple polygons. Information Processing Letters 77, 27-33 (2001)
34. Tan, X.: Approximation algorithms for the watchman route and zookeeper's problems. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 201-206. Springer, Heidelberg (2001)
35. Tan, X.: Approximation algorithms for the watchman route and zookeeper's problems. Discrete Applied Mathematics 136, 363-376 (2004)
36. Tan, X.: Linear-time 2-approximation algorithm for the watchman route problem. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 181-191. Springer, Heidelberg (2006)
37. Urrutia, J.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973-1027. Elsevier, Amsterdam (2000)