Constructing shortest watchman routes by divide-and-conquer

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

Volumn 762 LNCS, Issue , 1993, Pages 68-77

  Tan, Xuehou ^a   Hirata, Tomio ^b  

^a TOKAI UNIVERSITY   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIVIDE AND CONQUER; DIVIDE-AND-CONQUER ALGORITHM; SIMPLE POLYGON;

GEOMETRY;

EID: 0008962570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57568-5_236     Document Type: Conference Paper

References (8)

1. B. Chazelle, A theorem on polygon cutting with applications, Proceedings, 23th Annu. IEEE Symp. Found. of Comput. Sci., 339-349, 1982.
2. B. Chazelle, Triangulating a simple polygon in linear time, Proceedings, 31th Annu. IEEE Symp. Found. of Comput. Sci., 220-229, 1990.
3. W.P. Chin and S. Ntafos, Optimum watchman routes, Inform. Process. Lett. 28, 39-44, 1988.
4. W.P. Chin and S. Ntafos, Shortest watchman routes in simple polygons, Discrete Comput. Geometry 6, 9-31, 1991.
5. H. Edelsbrunner, J. O’Rourke and R. Seidel, Constructing arrangements of lines with applications. SIAM J. Comput. 15, 341-363, 1986.
6. 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, 209-233, 1987.
7. S. Ntafos, The robber route problem, Inform. Process. Lett. 34, 59-63, 1990.
8. X.H. Tan, T. Hirata and Y. Inagaki, An incremental algorithm for constructing shortest watchman routes, To appear in Internationa Journal of Computational Geometry & Applications (also in Lect. Note in Comput. Sci. 557, 163-175, 1991).