Convex drawings of graphs in two and three dimensions (preliminary version)
Proceedings of the twelfth annual symposium on Computational geometry
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters
Three-Dimensional VLSI: a case study
Journal of the ACM (JACM)
Universal 3-Dimensional Visibility Representations for Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing Stressed Planar Graphs in Three Dimensions
GD '95 Proceedings of the Symposium on Graph Drawing
New Results on a Visibility Representation of Graphs in 3D
GD '95 Proceedings of the Symposium on Graph Drawing
Two Algorithms for Three Dimensional Orthogonal Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
On Three-Dimensional Layout of Interconnection Networks
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
3DCube: A Tool for Three Dimensional Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Incremental Orthogonal Graph Drawing in Three Dimensions
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
3-D Visualization of Program Information
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Drawing with Colors (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Three-dimensional Grid Drawings of Graphs
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Embedding problems for paths with direction constrained edges
Theoretical Computer Science
Embedding Problems for Paths with Direction Constrained Edges
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Refinement of Three-Dimensional Orthogonal Graph Drawings
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract)
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
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.