Lower bounds for the number of bends in three-dimensional orthogonal graph drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 259-271

  Wood, David R ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; DRAWING (GRAPHICS);

LOWER BOUNDS; MAXIMUM DEGREE; MULTIGRAPHS; NON-TRIVIAL; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS;

C (PROGRAMMING LANGUAGE);

EID: 23044527401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_25     Document Type: Conference Paper

References (14)

1. T. C. Biedl. New lower bounds for orthogonal drawings. J. Graph Algorithms Appl., 2(7):1–31, 1998.
2. M. Closson, S. Gartshore, J. Johansen, and S. K. Wismath. Fully dynamic 3- dimensional orthogonal graph drawing. In J. Kratochvil, editor, Proc. Graph Drawing: 7th International Symp. (GD’99), volume 1731 of Lecture Notes in Comput. Sci., pages 49–58, Springer, 1999.
3. G. Di Battista, M. Patrignani, and F. Vargiu. A split&push approach to 3D orthogonal drawing. In Whitesides [10], pages 87–101.
4. P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Proc. Lett., 60(2):97–103, 1996.
5. P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. Discrete Applied Math., 103:55–87, 2000.
6. A. N. Kolmogorov and Ya. M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261–268, March 1967.
7. A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81–115, 1999.
8. M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. Di Battista, editor, Proc. Graph Drawing: 5th International Symp. (GD’97), volume 1353 of Lecture Notes in Comput. Sci., pages 284–290, Springer, 1998.
9. R. Tamassia, I. G. Tollis, and J. S. Vitter. Lower bounds for planar orthogonal drawings of graphs. Inform. Process. Lett., 39(1):35–40, 1991.
10. S. Whitesides, editor. Proc. Graph Drawing: 6th International Symp. (GD’98), volume 1547 of Lecture Notes in Comput. Sci., Springer, 1998.
11. 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 Austral. Comput. Sci. Comm., pages 3–8, 1997.
12. D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [10], pages 332–346.
13. D. R. Wood. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings. Technical Report CS-AAG-2000-01, Basser Department of Computer Science, The University of Sydney, 2000.
14. D. R. Wood. Three-Dimensional Orthogonal Graph Drawing. PhDthesis, School of Computer Science and Software Engineering, Monash University, Australia, 2000.