Advertisement

Some Results on Point Visibility Graphs

  • Subir Kumar Ghosh
  • Bodhayan Roy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8344)

Abstract

In this paper, we present two necessary conditions for recognizing point visibility graphs. We show that this recognition problem lies in PSPACE. We state new properties of point visibility graphs along with some known properties that are important in understanding point visibility graphs. For planar point visibility graphs, we present a complete characterization which leads to a linear time recognition and reconstruction algorithm.

Keywords

Planar Graph Hamiltonian Cycle Recognition Problem Vertex Cover Maximum Clique 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boyer, J.M., Myrvold, W.J.: On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. Journal of Graph Algorithms and Applications 8(3), 241–273 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 460–467 (1988)Google Scholar
  3. 3.
    Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT 25, 76–90 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    de Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer (2008)Google Scholar
  5. 5.
    Dujmovic, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. In: Computational Geometry Theory and Applications, pp. 194–212 (2007)Google Scholar
  6. 6.
    Edelsbrunner, H., O’Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing 15, 341–363 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Everett, H.: Visibility Graph Recognition. Ph. D. Thesis, University of Toronto, Toronto (January 1990)Google Scholar
  8. 8.
    Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)Google Scholar
  9. 9.
    Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments and polygons. ACM Computing Surveys 46(2), 22:1–22:29 (2014)Google Scholar
  10. 10.
    Ghosh, S.K., Roy, B.: Some results on point visibility graphs. arXiv:1209.2308 (September 2012)Google Scholar
  11. 11.
    Kára, J., Pór, A., Wood, D.R.: On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discrete & Computational Geometry 34(3), 497–506 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM 22, 560–570 (1979)CrossRefGoogle Scholar
  13. 13.
    Payne, M.S., Pór, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs. Discrete & Computational Geometry 48(3), 669–681 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  14. 14.
    Payne, M.S., Pór, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs. arXiv:1106.3622v1 (June 2011)Google Scholar
  15. 15.
    Roy, B.: Recognizing point visibility graphs. Graduate School Project Report, Tata Institute of Fundamental Research (May 2011)Google Scholar
  16. 16.
    Shapiro, L.G., Haralick, R.M.: Decomposition of two-dimensional shape by graph-theoretic clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-1, 10–19 (1979)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Subir Kumar Ghosh
    • 1
  • Bodhayan Roy
    • 1
  1. 1.School of Technology and Computer ScienceTata Institute of Fundamental ResearchMumbaiIndia

Personalised recommendations