Linear-time 2-approximation algorithm for the watchman route problem

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

Volumn 3959 LNCS, Issue , 2006, Pages 181-191

  Tan, Xuehou ^a  

^a TOKAI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR SYSTEMS; OPTIMAL SYSTEMS;

LINEAR-TIME ALGORITHM; WATCHMAN ROUTE PROBLEM;

PROBLEM SOLVING;

EID: 33745808873     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11750321_17     Document Type: Conference Paper

References (12)

1. M.H.Alsuwaiyel and D.T.Lee, Finding an approximate minimum-link visibility path inside a simple polygon, Inform. Process. Lett. 55 (1995) 75-79.
2. S.Carlsson, H.Jonsson and B.J.Nilsson, Approximating the shortest watchman route in a simple polygon, Technical report, Lund University, Sweden, 1997.
3. S.Carlsson, H.Jonsson and B.J.Nilsson, Finding the shortest watchman route in a simple polygon, Discrete Comput. Geom. 22 (1999) 377-402.
4. B.Chazelle and L.Guibas, Visibility and intersection problem in plane geometry, Discrete Comput. Geom. 4 (1989) 551-581.
5. G.Das, P.J.Heffernan and G.Narasimhan, LR-visibility in polygons, Comput. Geom. Theory Appl. 7 (1997) 37-57.
6. M.Dror, A.Efrat, A.Lubiw and J.S.B.Mitchell, Touring a sequence of polygons, Proc. 35th Annu. ACM Sympos. Theory Comput., 2003, pp. 473-482.
7. L.Guibas, J.Hershberger, D.Leven, M.Sharir and R.Tarjan, Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons, Algorithmica 2 (1987) 209-233.
8. P.J.Heffernan, An optimal algorithm for the two-guard problem, Int. J. Comput. Geom. Appl, 6 (1996) 15-44.
9. J.O'Rourke, Computational Geometry in C, Cambridge University Press, 1993.
10. X.Tan, Fast computation of shortest watchman routes in simple polygons, IPL 77 (2001) 27-33.
11. X.Tan, Approximation algorithms for the watchman route and zoo-keeper's problems, Discrete Applied Math. 136 (2004) 363-376.
12. X.Tan, T.Hirata and Y.Inagaki, Corrigendum to an incremental algorithm for constructing shortest watchman routes, Int. J. Comput. Geom. Appl. 9 (1999) 319-323.