Three-dimensional orthogonal graph drawing with optimal volume

Algorithmica (New York)

Volumn 44, Issue 3, 2006, Pages 233-255

  Biedl, Therese ^a   Thiele, Torsten ^b   Wood, David R ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Graph drawing; Lower bounds; Orthogonal; Three dimensional

Indexed keywords

ASPECT RATIO; GEOMETRY; VORTEX FLOW;

GRAPH DRAWINGS; LOWER BOUNDS; ORTHOGONAL;

GRAPHIC METHODS;

EID: 32344445029     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1148-z     Document Type: Article

References (29)

1. Mokhtar A. Aboelaze and Benjamin W. Wah. Complexities of layouts in three-dimensional VLSI circuits. Inform. Sci., 55(1-3):167-188, 1991.
2. Alok Aggarwal, Maria Klawe, and Peter Shor. Multilayer grid embeddings for VLSI. Algorithmica, 6(1): 129-151, 1991.
3. Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, 1992.
4. Therese Biedl. 1-Bend 3-D orthogonal box-drawings: two open problems solved. J. Graph Algorithms Appl., 5(3):1-15, 2001.
5. Therese C. Biedl. Three approaches to SD-orthogonal box-drawings. In Sue Whitesides, editor, Proc. 6th International Symp. on Graph Drawing (GD '98), volume 1547 of Lecture Notes in Computer Science, pages 30-43. Springer, Berlin, 1998.
6. Therese Biedl and Timothy Chan. A note on 3D orthogonal graph drawing. Discrete Appl, Math., to appear.
7. Therese C. Biedl and Michael Kaufmann. Area-efficient static and incremental graph drawings. In Rainer E. Burkhard and Gerhard J. Woeginger, editors, Proc. 5th Annual European Symp. on Algorithms (ESA '97), volume 1284 of Lecture Notes in Comput. Science, pages 37-52. Springer, Berlin, 1997.
8. Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, and Stephen K. Wismath. Bounds for orthogonal 3-D graph drawing. J. Graph Algorithms Appl., 3(4):63-79, 1999.
9. M. Closson, S. Gartshore, John R. Johansen, and Stephen K. Wismath. Fully dynamic 3-dimensional orthogonal graph drawing. J. Graph Algorithms Appl., 5(2):1-34, 2001.
10. Giuseppe Di Battista, Maurizio Patrignani, and Francesco Vargiu. A split&push approach to 3D orthogonal drawing. J. Graph Algorithms Appl., 4(3):105-133, 2000.
11. Guiseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualisation of Graphs. Prentice-Hall, Englewood Cliffs, NJ, 1999.
12. Peter Eades, Charles Stirk, and Sue Whitesides. The techniques of Kolmogorov and Barzdin for three dimensional orthogonal graph drawings. Inform. Process Lett., 60(2):97-103, 1996.
13. Peter Eades, Antonios Symvonis, and Sue Whitesides. Three dimensional orthogonal graph drawing algorithms. Discrete Appl. Math., 103:55-87, 2000.
14. Sándor Fekete and Henk Meijer. Rectangle and box visibility graphs in 3D. Internat. J. Comput. Geom. Appl., 9(1): 1-21, 1999.
15. Èrnests K. Fogels. An elementary proof of formulae of de la Vallée Poussin (in Russian). Latvijas PSR Zinãtņu Akad. Vestis, 11(40):123-130, 1950.
16. Ken' ichi Hagihara, Nobuki Tokura, and Naoya Suzuki. Graph embedding on a three-dimensional model. Systems Comput. Controls, 14(6):58-66, 1983.
17. Daniel J. Kleitman and Michael M. Krieger. An optimal bound for two dimensional bin packing. In Proc. 16th Annual Symp. on Foundations of Computer Science (FOCS '75), pages 163-168. IEEE, New York, 1975.
18. F. Thomson Leighton and Arnold L. Rosenberg. Three-dimensional circuit layouts. SIAM J. Comput., 15(3):793-813, 1986.
19. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
20. Gregory A. Margulis. Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and superconcentrators. Probl. Inf. Transm., 24(1):39-64, 1988.
21. Achilleas Papakostas and Ioannis G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.
22. Franco P. Preparata. Optimal three-dimensional VLSI layouts. Math. Systems Theory, 16:1-8, 1983.
23. Arnold L. Rosenberg. Three-dimensional VLSI: a case study. J. Assoc. Comput. Mach., 30(2):397-416, 1983.
24. Avi Widgerson and David Zuckerman. Expanders that beat the eigenvalue bound: explicit construction and applications. In Proc. 25th Annual ACM Symp. on Theory of Computing (STOC '93), pages 245-251, 1993.
25. David R. Wood. Multi-dimensional orthogonal graph drawing with small boxes. In Jan Kratochvil, editor, Proc. 7th International Symp. on Graph Drawing (GD '99), volume 1731 of Lecture Notes in Computer Science, pages 311-222. Springer, Berlin, 1999.
26. David R. Wood. A new algorithm and open problems in three-dimensional orthogonal graph drawing. In Rajeev Raman and Jamie Simpson, editors, Proc. 8th Australasian Workshop on Combinatorial Algorithms (AWOCA '97), pages 157-167. Curtin University of Technology, Australia, 1999.
27. David R. Wood. Bounded degree book embeddings and three-dimensional orthogonal graph drawing. In P. Mutzel, M. Jünger, and S. Leipert, editors, Proc. 9th International Symp. on Graph Drawing (GD '01), volume 2265 of Lecture Notes in Computer Science, pages 312-327. Springer, Berlin, 2002.
28. David R. Wood. Optimal three-dimensional orthogonal graph drawing in the general position model. Theoret. Comput. Sci., 299(1-3):151-178, 2003.
29. David R. Wood. Minimising the number of bends and volume in three-dimensional orthogonal graph drawings with a diagonal vertex layout. Algorithmica, 39(3):235-253, 2004.