An Algorithm for Three-Dimensional Orthogonal Graph Drawing

  • David R. Wood
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cube. For an n-vertex m-edge graph with maximum degree six, the algorithm produces drawings with bounding box volume at most 2.37n3 and with a total of 7m/3 bends, using no more than 4 bends per edge route. For maximum degree five graphs the bounding box has volume n3 and each edge route has two bends. These results establish new bounds for 3-dimensional orthogonal graph drawing algorithms and improve on some existing bounds.

References

  1. [1]
    H. Alt, M. Godau, and S. Whitesides. Universal 3-dimensional visibility representation for graphs. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 8–19, Berlin, 1996. Springer.Google Scholar
  2. [2]
    T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Orthogonal 3-D graph drawing. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 76–86, Berlin, 1998. Springer.Google Scholar
  3. [3]
    R.L. Brooks. On colouring the nodes of a network. Proc. Cambridge Philos. Soc., 37:194–197, 1941.MATHMathSciNetCrossRefGoogle Scholar
  4. [4]
    T. Calamoneri and A. Massini. On three-dimensional layout of interconnection networks. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 64–75, Berlin, 1998. Springer.Google Scholar
  5. [5]
    M. Chrobak, M. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annual ACM Symp. on Computational Geometry, pages 319–328, 1996.Google Scholar
  6. [6]
    R.F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199–208, 1996.CrossRefMathSciNetGoogle Scholar
  7. [7]
    P. Eades and Q.-W. Feng. Multilevel visualization of clustered graphs. In S. North, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’96), volume 1190 of Lecture Notes in Comput. Sci., pages 101–112, Berlin, 1997. Springer.Google Scholar
  8. [8]
    P. Eades and P. Garvan. Drawing stressed planar graphs in three dimensions. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 212–223, Berlin, 1996. Springer.Google Scholar
  9. [9]
    P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Information Processing Lett., 60(2):97–103, 1996.MATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’96), volume 1190 of Lecture Notes in Comput. Sci., pages 139–154, Berlin, 1997. Springer.Google Scholar
  11. [11]
    P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. 1998, submitted.Google Scholar
  12. [12]
    S. Fekete, M. Houle, and S. Whitesides. New results on a visibility representation of graphs in 3D. In F. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD’95), volume 1027 of Lecture Notes in Comput. Sci., pages 234–241, Berlin, 1996. Springer.Google Scholar
  13. [13]
    A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annual European Symp. on Algorithms (ESA’96), volume 1136 of Lecture Notes in Comput. Sci., pages 12–26, Berlin, 1996. Springer.Google Scholar
  14. [14]
    P.L. Garvan. Drawing and labelling graphs in three-dimensions. In M. Patel, editor, Proc. 20th Australasian Comput. Sci. Conf. (ACSC’97), volume 19 (1) of Australian Comput. Sci. Comms., pages 83–91. Macquarie University, 1997.Google Scholar
  15. [15]
    H. Koike. An application of three-dimensional visualization to object-oriented programming. In Proc. Advanced Visual Interfaces (AVI’92), volume 36 of World Scientific Series in Comput. Sci, pages 180–192, 1992.Google Scholar
  16. [16]
    A.N. Kolmogorov and Ya.M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261–268, March 1967.Google Scholar
  17. [17]
    J. Pach, T. Thiele, and G. Toth. Three-dimensional grid drawings of graphs. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 47–51, Berlin, 1998. Springer.CrossRefGoogle Scholar
  18. [18]
    A. Papakostas and I.G. Tollis. Incremental orthogonal graph drawing in three dimensions. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 52–63, Berlin, 1998. Springer.CrossRefGoogle Scholar
  19. [19]
    M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. DiBattista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 284–290, Berlin, 1998. Springer.CrossRefGoogle Scholar
  20. [20]
    F.P. Preparata. Optimal three-dimensional VLSI layouts. Math. Systems Theory, 16:1–8, 1983.MATHCrossRefMathSciNetGoogle Scholar
  21. [21]
    S.P. Reiss. 3-D visualization of program information. In R. Tamassia and I. Tollis, editors, Proc. Graph Drawing: DIMACS International Workshop (GD’94), volume 894 of Lecture Notes in Comput. Sci., pages 12–24, Berlin, 1995. Springer.Google Scholar
  22. [22]
    A.L. Rosenberg. Three-dimensional VLSI: A case study. J. ACM, 30(2):397–416, 1983.MATHCrossRefGoogle Scholar
  23. [23]
    D.R. Wood. On higher-dimensional orthogonal graph drawing. In J. Harland, editor, Proc. Computing: the Australasian Theory Symp. (CATS’97), volume 19 (2) of Australian Comput. Sci. Comms., pages 3–8. Macquarie University, 1997.Google Scholar
  24. [24]
    D.R. Wood. Towards a 2-bends algorithm for three-dimensional orthogonal graph drawing. In V. Estivill-Castro, editor, Proc. Australasian Workshop on Combinatorial Algorithms (AWOCA’97), pages 102–107. Queensland University of Technology, 1997.Google Scholar
  25. [25]
    D.R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical Report 98/03, School of Computer Science and Software Engineering, Monash University, 1998, available at ftp://ftp.csse.monash.edu.au.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • David R. Wood
    • 1
  1. 1.School of Computer Science and Software EngineeringMonash UniversityClaytonAustralia

Personalised recommendations