The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Information Processing Letters
Computing Proximity Drawings of Trees in the 3-Dimemsional Space
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Universal 3-Dimensional Visibility Representations for Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs
GD '95 Proceedings of the Symposium on Graph Drawing
3D Graph Drawing with Simulated Annealing
GD '95 Proceedings of the Symposium on Graph Drawing
GOVE Grammar-Oriented Visualisation Environment
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
COMAIDE: Information Visualization using Cooperative 3D Diagram Layout
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
Drawing 2-, 3- and 4-colorable Graphs in O(n2) Volume
GD '96 Proceedings of the Symposium on Graph Drawing
Integration of Declarative Approaches
GD '96 Proceedings of the 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
Drawing with Colors (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
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
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
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Human-centered visualization environments
Human-centered visualization environments
Visual community detection: an evaluation of 2d, 3d perspective and 3d stereoscopic displays
GD'11 Proceedings of the 19th international conference on Graph Drawing
Architecture customization of on-chip reconfigurable accelerators
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
| Hi-index | 0.00 |
We present a method for constructing orthogonal drawings of graphs of maximum degree six in three dimensions. Such a method is based on generating the final drawing through a sequence of steps, starting from a "degenerate" drawing. At each step the drawing "splits" into two pieces and finds a structure more similar to its final version. Also, we test the effectiveness of our approach by performing an experimental comparison with several existing algorithms.