On recognizing and characterizing visibility graphs of simple polygons

  • Subir Kumar Ghosh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 318)


In this paper, we establish three necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We also show that visibility graphs of simple polygons do not posses the characteristics of several special classes of graphs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AR85]
    D. Avis and D. Rappaport, ‘Computing the largest empty convex subset of a set of points', Proceedings of the first ACM symposium on computational geometry, pp. 161–167, 1985.Google Scholar
  2. [B80]
    M.A. Buckinghan, ‘Circle graphs', Ph.D. Dissertation, Report no. NSO-21, Courant Institute of Mathematical Sciences, 1980.Google Scholar
  3. [EL85]
    Hossam A. ElGindy, ‘Hierarchical decomposition of polygons with applications', Ph.D. Dissertation, McGill University, April 1985.Google Scholar
  4. [G72]
    F. Gavril, ‘Algorithms for minimum colouring, maximum clique, minimum convering by cliques, and maximum independent set of a chordal graph', SIAM Journal on Computing, vol. 1, no.2, pp. 180–187, 1972.Google Scholar
  5. [G80]
    M.C. Golumbic, ‘Algorithmic graph theory and perfect graphs', Academic Press, 1980.Google Scholar
  6. [GHS85]
    C.P. Gabor, W. Hsu and K.J. Supowit, ‘Recognizing circle graphs in polynomial time', Proceedings of 26th IEEE Annual Symposium on Foundation of Computer Science, pp.106–116, 1985.Google Scholar
  7. [LW79]
    T. Lazano-Perez and M.A. Wesley, ‘An algorithm for planning collision-free paths among polygonal obstacles', Commun. of ACM, vol. 22, pp.560–570, 1979.Google Scholar
  8. [O87]
    J. O'Rourke, Art gallery theorems and algorithms, Oxford University Press, 1987.Google Scholar
  9. [PLE71]
    A. Pnueli, A. Lempel and S. Even, ‘Transitive orientation of graphs and identification of permutation graphs', Canadian Journal of Mathematics, vol.23, no.1, pp. 160–175, 1971.Google Scholar
  10. [SH79]
    L.G. Shapiro and R.M. Haralick, ‘Decomposition of two-dimentional shape by graph-theoretic clustering', IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-1, no.1, pp. 10–19, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Subir Kumar Ghosh
    • 1
  1. 1.Computer Science Group Tata Institute of Fundamental ResearchBombayIndia

Personalised recommendations