Universal 3-Dimensional visibility representations for graphs

  • Helmut Alt
  • Michael Godau
  • Sue Whitesides
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)

Abstract

This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d correspond to vertices and vertical visibilities between these objects correspond to edges. We ask which classes of simple objects are universal, i.e. powerful enough to represent all graphs. In particular, we show that there is no constant k for which the class of all polygons having k or fewer sides is universal. However, we show by construction that every graph on n vertices can be represented by polygons each having at most 2n sides. The construction can be carried out by an O(n2) algorithm. We also study the universality of classes of simple objects (translates of a single, not necessarily polygonal object) relative to cliques Kn and similarly relative to complete bipartite graphs Kn,m.

References

  1. [A]
    N. Alon, “The number of polytopes, configurations and real matroids”, Mathematika 33 (1986), pp. 62–71Google Scholar
  2. [BEF+]
    P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides, “On a visibility representation for graphs in three dimensions,” in Snapshots of Computational and Discrete Geometry, v. 3, eds. D. Avis and P. Bose, McGill University School of Computer Science Technical Report SOCS-94.50, July 1994, pp. 2–25Google Scholar
  3. [CDR]
    J. Canny, B. Donald and E. K. Ressler, “A rational rotation method for robust geometric algorithms”, Proc. 8th ACM Symp. Comput. Geom., 1992, 251–260.Google Scholar
  4. [DETT]
    G. Di Battista, P. Eades, R. Tamassia and I. Tollis, “Algorithms for drawing graphs: an annotated bibliography”, Computational Geometry Theory and Applications, v. 4, 1994, 235–282. Also available from wilma.cs.brown.edu by ftp.Google Scholar
  5. [DH]
    A. Dean and J. Hutchison, “Rectangle-visibility representations of bipartite graphs,” in Proc. Graph Drawing '94, Princeton, NJ, 1994. Lecture Notes in Computer Science LNCS v. 894, Springer-Verlag, 1995.Google Scholar
  6. [ES]
    P. Erdös, Gy. Szekeres, “A Combinatorial Problem in Geometry”, Compositio Math. 2, 1935, 463–470.Google Scholar
  7. [F]
    S. Felsner, personal communication, 1995.Google Scholar
  8. [FHW]
    S. Fekete, M. Houle and S. Whitesides, “New results on a visibility representation of graphs in 3D,” in Proc. Symposium on Graph Drawing (GD '95), Passau, Germany, 1995, Springer-Verlag LNCS series (these proceedings).Google Scholar
  9. [G]
    B. Grünbaum, “On a Conjecture of H. Hadwiger”, Pacific J. Math., 11, 215–219.Google Scholar
  10. [H]
    H. Hadwiger, “Über Treffanzahlen bei translationsgleichen Eikörpern”, Arch. Math., Vol. VIII, 1957, 212–213.CrossRefGoogle Scholar
  11. [KKU]
    E. Kranakis, D. Krizanc and J. Urrutia, “On the number of directions in visibility representations of graphs,” in Proc. Graph Drawing '94, Princeton, NJ, 1994. Lecture Notes in Computer Science LNCS v. 894, Springer-Verlag, 1995, 167–176.Google Scholar
  12. [Rom]
    K. Romanik, “Directed VR-representable graphs have unbounded dimension,” in Proc. Graph Drawing '94, Princeton, NJ, 1994. Lecture Notes in Computer Science LNCS v. 894, Springer-Verlag, 1995, 177–181.Google Scholar
  13. [TT]
    R. Tamassia and I. Tollis, “A unified approach to visibility representations of planar graphs,” Discrete Comput. Geom. v. 1, 1986, 321–341.CrossRefGoogle Scholar
  14. [W]
    S. Wismath, “Characterizing bar line-of-sight graphs,” in Proc. ACM Symp. on Computational Geometry, 1985, 147–152.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Helmut Alt
    • 2
  • Michael Godau
    • 2
  • Sue Whitesides
    • 1
  1. 1.McGill UniversityMontrealCanada
  2. 2.Institut für InformatikFU BerlinBerlinGermany

Personalised recommendations