In this paper we present the first non-trivial lower bounds for the total number of bends in 3-D orthogonal drawings of maximum degree six graphs. In particular, we prove lower bounds for the number of bends in 3-D orthogonal drawings of complete simple graphs and multigraphs, which are tight in most cases. These result are used as the basis for the construction of infinite classes of c-connected simple graphs and multigraphs (2 c 6) of maximum degree \Delta (3 \Delta 6) with lower bounds on the total number of bends for all members of the class. We also present lower bounds for the number of bends in general position 3-D orthogonal graph drawings. These results have significant ramifications for the `2-bends ' problem, which is one of the most important open problems in the field. 1
|
351
|
Cone Trees: animated 3D visualizations of hierarchical information
– Robertson, Mackinlay, et al.
- 1991
|
|
92
|
Evaluating Stereo and Motion Cues for Visualizing Information Nets in Three Dimensions
– Ware, Franck
- 1996
|
|
70
|
Congruent graphs and the connectivity of graphs
– Whitney
- 1932
|
|
51
|
Viewing a Graph in a Virtual Reality Display is Three Times as Good as a 2D
– Ware, Franck
|
|
36
|
The role of another spatial dimension in software visualization
– Koike
- 1993
|
|
36
|
Three-dimensional circuit layouts
– Leighton, Rosenberg
- 1986
|
|
32
|
An engine for the 3D visualization of program information
– Reiss
- 1995
|
|
26
|
Three-dimensional VLSI: A case study
– Rosenberg
- 1983
|
|
24
|
An algorithm for three-dimensional orthogonal graph drawing
– Wood
- 2000
|
|
24
|
Rectilinear Planar Drawings with Few Bends in Each Edge
– Even, Granot
- 1994
|
|
20
|
Three dimensional orthogonal graph drawing algorithms
– EADES, SYMVONIS, et al.
- 2000
|
|
20
|
An application of three-dimensional visualization to object-oriented programming
– Koike
- 1992
|
|
18
|
Incremental Orthogonal Graph Drawing in Three Dimensions
– Papakostas, Tollis
- 1999
|
|
18
|
Multi-dimensional orthogonal graph drawing with small boxes
– Wood
- 1999
|
|
17
|
Three approaches to 3D-orthogonal box-drawings
– Biedl
- 1998
|
|
17
|
Three-dimensional orthogonal graph drawing with optimal volume
– BIEDL, THIELE, et al.
- 2001
|
|
17
|
The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings
– Eades, Stirk, et al.
- 1996
|
|
15
|
Multi-layer grid embeddings for VLSI
– Aggarwal, Klawe, et al.
- 1991
|
|
15
|
Optimal three-dimensional VLSI layouts
– Preparata
- 1983
|
|
14
|
Fully dynamic 3dimensional orthogonal graph drawing
– Closson, Gartshore, et al.
- 1999
|
|
14
|
Heuristics for 3D-orthogonal graph drawings
– Biedl
- 1995
|
|
12
|
A split&push approach to 3D orthogonal drawing
– Battista, Patrignani, et al.
- 2000
|
|
11
|
Lower bounds for planar orthogonal drawings of graphs
– Tamassia, Tollis, et al.
- 1991
|
|
9
|
On the realization of nets
– Kolmogorov, Barzdin
- 1967
|
|
9
|
3DCube: a tool for three dimensional graph drawing
– Patrignani, Vargiu
- 1998
|
|
9
|
Minimising the number of bends and volume in threedimensional orthogonal graph drawings with a diagonal vertex layout, submitted. See
– Wood
- 2001
|
|
8
|
A new algorithm and open problems in three-dimensional orthogonal graph drawing
– Wood
- 1999
|
|
7
|
Bounds for orthogonal 3-D graph drawing
– Biedl, Shermer, et al.
- 1999
|
|
6
|
Cross-coloring: improving the technique by Kolmogorov and Barzdin
– Biedl, Chan
- 2000
|
|
5
|
The techniques of Kolmogorov and Barzdin for three dimensional orthogonal graph drawings
– Eades, Stirk, et al.
- 1996
|
|
4
|
Orthogonal drawings with few layers
– Biedl, Johansen, et al.
- 2002
|
|
3
|
Graph embedding on a three-dimensional model
– Hagihara, Tokura, et al.
- 1983
|
|
2
|
New lower bounds for orthogonal drawings
– Biedl
- 1998
|
|
