Two-guard walkability of simple polygons

International Journal of Computational Geometry and Applications

Volumn 8, Issue 1, 1998, Pages 85-116

  Tseng, L H ^a   Heffernan, P ^b   Lee, D T ^c  

^a FENG CHIA UNIVERSITY   (Taiwan)

^b PRUDENTIAL FINANCIAL   (United States)

^c Northwestern University   (United States)

Author keywords

Circular arc graph; Motion planning; Simple polygon; Visibility; Watchman routes

Indexed keywords

EID: 0032358771     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000060     Document Type: Article

References (9)

1. B. Chazelle, "Triangulating a simple polygon in linear time," Proc. of the S1-st Annual IEEE Symposium on Foundation of Computer Science, 1990, 220-229.
2. B. Chazelle and L. Guibas, "Visibility and intersection problems in plane geometry," Discrete and Computational Geometry, 4(6), 1989, 551-581.
3. L. Guibas, J. Hershberger, D. Leven, M. Sharir and R. Tarjan, "Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons," Algorithmica, 2, 1987, 209-233.
4. P. Heffernan, "An optimal algorithm for the two-guard problem," Proc. of the Ninth ACM Symposium on Computational Geometry, 1993, 348-358.
5. J. Hershberger, "An optimal visibility graph algorithm for triangulated simple polygons," Algorithmica, 4, 1989, 141-155.
6. C. Icking and R. Klein, "The two guards problem," Int'l J. Comput. Geometry & Application, 2,3 (Sept. 1992), 257-285.
7. Y. Ke, "Detecting the weak visibility of a simple polygon and related problems," Tech. Report, The Johns Hopkins University, 1987.
8. D. T. Lee, M. Sarrafzadeh and Y. F. Wu, "Minimum cuts for circular-arc graphs," SIAM J. of Comput., 19(6), 1990, 1041-1050.
9. S. Suri, "Minimum link paths in polygons and related problems," Ph.D. thesis, The Johns Hopkins University, August 1987.