An optimal algorithm for the two-guard problem

International Journal of Computational Geometry and Applications

Volumn 6, Issue 1, 1996, Pages 15-44

  Heffernan, Paul J ^a  

^a University of Memphis   (United States)

Author keywords

Computational geometry; Guard problems; Polygonal visibility; Shortest paths

Indexed keywords

EID: 0030552666     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000034     Document Type: Article

References (16)

1. G. Icking and R. Klein, "The two guards problem," Inter. J. on Computational Geometry and Applications, 2 (1992), pp. 257-285.
2. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, 1987.
3. V. Chvatal, "A combinatorial theorem in plane geometry," J. of Combinatorial Theory B, 13 (1975), pp. 39-41.
4. S. Fisk, "A short proof of Chvatal's watchman theorem," J. of Combinatorial Theory B, 24 (1978), p. 374.
5. D.T. Lee and A.K. Lin, "Computational complexity of art gallery problems," IEEE Trans, on Information Theory, 32 (1986), pp. 276-282.
6. T. Shermer, Visibility Properties of Polygons, Ph.D. dissertation, McGill University, June 1989.
7. W.-P. Chin and S. Ntafos, "Optimum watchman routes," Proc. 2nd ACM Symp. on Computational Geometry, 1986, pp. 24-33.
8. J.S.B. Mitchell and E.L. Wynters, "Optimal motion of covisible points among obstacles in the plane," Proc. 2nd Canadian Conf. on Computational Geometry, 1990, pp. 116-119.
9. L.H. Tseng and D.T. Lee, "Two-guard walkability of simple polygons," manuscript, 1992.
10. D.T. Lee and F.P. Preparata, "Euclidean shortest paths in the presence of rectilinear-barriers," Networks, 14 (1984), pp. 393-410.
11. 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), pp. 209-233.
12. B. Chazelle, "Triangulating a simple polygon in linear time," Discrete and Computational Geometry, 6 (1991), pp. 485-524.
13. D. Avis and G.T. Toussaint, "An optimal algorithm for determining the visibility of a polygon from an edge," IEEE Trans, on Computers, 30 (1981), pp. 910-914.
14. H. ElGindy and G.T. Toussaint, "On geodesic properties of polygons relevant to linear time triangulation," The Visual Computer, 5 (1989), pp. 68-74.
15. P.J. Heffernan, "Linear-time algorithms for weakly-monotone polygons," Computational Geometry: Theory and Applications; to appear.
16. S.-H. Lee and K.-Y. Chwa, "Some chain visibility problems in a simple polygon," Algorithmica, 5 (1990), pp. 485-507.