Approximation algorithms for the watchman route and zookeeper's problems

Discrete Applied Mathematics

Volumn 136, Issue 2-3, 2004, Pages 363-376

  Tan, Xuehou ^a  

^a TOKAI UNIVERSITY   (Japan)

Author keywords

Approximation algorithms; Computational geometry; Reflection principle; Watchman route problem; Zookeeper's problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; REFLECTION PRINCIPLE; WATCHMAN ROUTE PROBLEM;

PROBLEM SOLVING;

EID: 0347947236     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00451-7     Document Type: Conference Paper

References (19)

1. Alsuwaiyel M.H., Lee D.T. Finding an approximate minimum-link visibility path inside a simple polygon. Inform. Process. Lett. 55:1995;75-79.
2. S. Bespamyatnikh, An O(n log n) algorithm for the zookeeper's problem, in: Comput. Geom. Theory Appl. 24 (2002) 63-74.
3. S. Carlsson, H. Jonsson, B.J. Nilsson, Approximating the shortest watchman route in a simple polygon, Technical Report, Department of Computer Science, Lund University, Sweden, 1997.
4. Chazelle B. Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6:1991;485-524.
5. Chazelle B., Guibas L. Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4:1989;551-581.
6. Chin W.P., Ntafos S. Optimum watchman routes. Inform. Process. Lett. 28:1988;39-44.
7. Chin W.P., Ntafos S. The zookeeper route problem. Inform. Sci. 63:1992;245-259.
8. Das G., Heffernan P.J., Narasimhan G. LR-visibility in polygons. Comput. Geom. Theory Appl. 7:1997;37-57.
9. Guibas L., Hershberger J., Leven D., Sharir M., Tarjan R. Linear time algorithms for visibility and shortest path problems inside simple triangulated polygons. Algorithmica. 2:1987;209-233.
10. Hershberger J. Finding the visibility graph of a simple polygon in time proportional to its size. Algorithmica. 4:1989;141-155.
11. J. Hershberger, J. Snoeyink, An efficient solution to the zookeeper's problem, Proceedings of the Sixth Canadian Conference on Computational Geometry, Saskatoon, SK, Canada 1994, pp. 104-109.
12. 3, in: Comput. Geom. Theory Appl. 10 (1998) 31-46.
13. H. Jonsson, On the zookeeper's problem, in: An approximative solution to the zookeeper's problems, to appear in Inform. Process. Lett.
14. C. Mata, J.S.B. Mitchell, Approximation algorithms for geometric tour and network design problems, in: Proceedings of the 11th Annual ACM Symposium on Computational Geometry, Vancouver, BC, Canada 1995, pp. 360-369.
15. B. Nilsson, Guarding art galleries; Methods for mobile guards, Ph.D. Thesis, Lund University, Sweden, 1995.
16. Tan X. Shortest zookeeper's routes in simple polygons. Inform. Process. Lett. 77:2001;23-26.
17. Tan X. Fast computation of shortest watchman routes in simple polygons. Inform. Process. Lett. 77:2001;27-33.
18. Tan X., Hirata T., Inagaki Y. An incremental algorithm for constructing shortest watchman routes. Internat. J. Comput. Geom. Appl. 3:1993;351-365.
19. Tan X., Hirata T., Inagaki Y. Corrigendum to an incremental algorithm for constructing shortest watchman routes. Internat. J. Comput. Geom. Appl. 9:1999;319-323.