The vertex-edge visibility graph of a polygon

Computational Geometry: Theory and Applications

Volumn 10, Issue 2, 1998, Pages 105-120

  O'Rourke, Joseph ^a   Streinu, Ileana ^a  

^a SMITH COLLEGE   (United States)

Author keywords

Visibility complex; Visibility graphs

Indexed keywords

EID: 0040531874     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00011-4     Document Type: Article

References (13)

1. J. Abello, K. Kumar, Visibility graphs and oriented matroids, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894, Springer, New York, 1995, pp. 147-158.
2. D. Avis, G.T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput. 30 (1981) 910-1014.
3. H. Everett, A. Lubiw, J. O'Rourke, Recovery of convex hulls from external visibility graphs, in: Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 309-314.
4. S.K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Discrete Comput. Geom. 17 (2) (1997) 143-162.
5. S.K. Ghosh, D.M. Mount, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20 (1991) 888-910.
6. I.E. Goodman, R. Pollack, Semispaces of configurations, cell complexes of arrangements, J. Combin. Theory Ser. A 37 (1984) 257-293.
7. L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
8. J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica 4 (1989) 141-155.
9. J. O'Rourke, Computational geometry column 18, Internat. J. Comput. Geom. Appl. 3 (1993) 107-113; also: SIGACT News 24 (1) (1993) 20-25.
10. J. O'Rourke, Computational geometry column 18, Internat. J. Comput. Geom. Appl. 3 (1993) 107-113; also: SIGACT News 24 (1) (1993) 20-25.
11. J. O'Rourke, I. Streinu, Pseudo-visibility graphs in pseudo-polygons: Part I, Technical Report 041, Dept. Comput. Sci., Smith College, Northampton, MA, January 1996; revised April 1996.
12. J. O'Rourke, I. Streinu, Pseudo-visibility graphs in pseudo-polygons: Part II, Technical Report 042, Dept. Comput. Sci., Smith College, Northampton, MA, April 1996.
13. M. Pocchiola, G. Vegter, The visibility complex, Internat. J. Comput. Geom. Appl. 6 (3) (1996) 279-308.