Orthogonal edge visibility graphs of polygons with holes

International Journal of Computational Geometry and Applications

Volumn 10, Issue 1, 2000, Pages 79-102

  Srinivasaraghavan, G ^a   Mukhopadhyay, Asish ^b  

^a INFOSYS TECHNOLOGIES LTD   (India)

^b NONE

Author keywords

Edge visibility; Holes; Necessary conditions; Orthogonal polygons; Recognition; Sufficiency; Visibility graphs

Indexed keywords

EID: 0034391288     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000061     Document Type: Article

References (8)

1. J. Abello, Ö. Eḡicioḡlu and K. Kumar, " Recognizing visibility graphs of staircase polygons and the weak Bruhat order II: from maximal chains to polygons", Manuscript 1992.
2. J. Abello and Ö. Eḡicioḡlu, "Visibility graphs of staircase polygons with uniform step h", International Journal of Computational Geometry and Applications, 3(1993) 27-37.
3. J. Abello, Ö. Eḡicioḡlu and K. Kumar "Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I", Discrete and Computational Geometry, 14, (1995), 331-358
4. Subir K. Ghosh, "On recognizing and characterizing visibility graphs of simple polygons", Discrete and Computational Geometry, (1997) 143-162.
5. S.-Y. Lin and C. Chen, "Planar Visibility Graphs," Proc. 6th Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, August 1994, pp 30-35.
6. Joseph O'Rourke, Art Gallery Theorems and Algorithms, (Oxford University Press, New York, 1987).
7. G. Srinivasaraghavan and Asish Mukhopadhyay, "On some classes of unrealizable orthogonal visibility graphs", Technical Report TRCS-91-112, Department of Computer Science, Indian Institute of Technology, Kanpur, India, 1991.
8. S. K. Wismath, " Characterizing bar line-of-sight graphs", Proc. 1st ACM Symposium on Computational Geometry, Baltimore, MD, June 1985, pp 147-152.