Orthogonal 3-D graph drawing

  • T. Biedl
  • T. Shermer
  • S. Whitesides
  • S. Wismath
Drawings in the Air
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)


This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, Kn in particular, with vertices drawn as boxes. It establishes an asymptotic lower bound for the volume of the bounding box of such drawings and exhibits a construction that achieves this bound. No edge route in this unconstrained construction bends more than three times.

For drawings constrained to have at most k bends on any edge route, simple constructions are given for k = 1 and k = 2. The unconstrained construction handles the k ≥ 3 cases, while for k = 0 (no bends), it is proved here that not all graphs can be drawn.


  1. [BEFLMRSW93]
    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. Proc. Graph Drawing '93, Paris, 1993, 38–39.Google Scholar
  2. [BMT97]
    T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In these proceedings.Google Scholar
  3. [Bra96]
    F. Brandenburg, ed. Symposium on Graph Drawing '95, Passau, Germany, Springer-Verlag LNCS 1027, 1996.Google Scholar
  4. [ESW97]
    P. Eades, A. Symvouis and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, ed. Symposium on Graph Drawing '96, Berkeley, California, Springer Verlag LNCS 1190, 1997, 139–154.Google Scholar
  5. [FHW96]
    S. Fekete, M. Houle and S. Whitesides. New results on a visibility representation of graphs in 3d. In [Bra96], 234–241.Google Scholar
  6. [FK96]
    U. Fößmeier and M. Kaufmann, Drawing high degree graphs with low bend numbers. In [Bra96], 254–266.Google Scholar
  7. [GRS80]
    R. Graham, B.L. Rothschild and J. Spencer. Ramsey Theory. John Wiley, 1980.Google Scholar
  8. [PT96]
    A. Papakostas and 1. Tollis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, Springer Verlag LNCS, 1997. To appear.Google Scholar
  9. [PT97]
    A. Papakostas and I. Tollis. Incremental orthogonal graph drawing in three dimensions. In these proceedings.Google Scholar
  10. [Ros83]
    A. Rosenberg. Three-dimensional VLSI: A case study. Journal of the Association of Computing Machinery, 30 (3), 1983, 397–416.Google Scholar
  11. [TT86]
    R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. J. of Discrete and Computational Geometry 1, 1986, 321–341.Google Scholar
  12. [Wis85]
    S. K. Wismath. Characterizing bar line-of-sight graphs. Proc. of the 1st ACM Symp. on Computational, Geometry, Baltimore, Maryland, USA, 1985, 147–152.Google Scholar
  13. [Yan89]
    M. Yannakakis, Embedding planar graphs in four pages. 18th Annual ACM Symposium on Theory of Computing, J. Comput. System Sci. 38 (1989), no. 1, 36–67.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • T. Biedl
    • 1
  • T. Shermer
    • 2
  • S. Whitesides
    • 1
  • S. Wismath
    • 3
  1. 1.School of Computer ScienceMcGill UniversityMontrealCanada
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnabyCanada
  3. 3.Department of Mathematics and Computer ScienceUniversity of LethbridgeLethbridgeCanada

Personalised recommendations