Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Evaluating stereo and motion cues for visualizing information nets in three dimensions
ACM Transactions on Graphics (TOG)
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
Universal 3-dimensional visibility representations for graphs
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Three-Dimensional VLSI: a case study
Journal of the ACM (JACM)
Three-dimensional orthogonal graph drawing algorithms
Discrete Applied Mathematics
On the complexity of orthogonal compaction
Computational Geometry: Theory and Applications
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
New Lower Bounds for Orthogonal Graph Drawings
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
Two Algorithms for Three Dimensional Orthogonal Graph Drawing
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
Three Approaches to 3D-Orthogonal Box-Drawings
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Improved Algorithms and Bounds for Orthogonal Drawings
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
Orthogonal Drawings with Few Layers
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Bounded degree acyclic decompositions of digraphs
Journal of Combinatorial Theory Series B
Linkless symmetric drawings of series parallel digraphs
Computational Geometry: Theory and Applications
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
A note on 3D orthogonal graph drawing
Discrete Applied Mathematics
Complexity results for three-dimensional orthogonal graph drawing
Journal of Discrete Algorithms
Clean the graph before you draw it!
Information Processing Letters
Balanced vertex-orderings of graphs
Discrete Applied Mathematics
Note: A note on 3D orthogonal graph drawing
Discrete Applied Mathematics
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Optimal 3D angular resolution for low-degree graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Complexity results for three-dimensional orthogonal graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
On the complexity of the balanced vertex ordering problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Hexagonal grid drawings: algorithms and lower bounds
GD'04 Proceedings of the 12th international conference on Graph Drawing
Visual community detection: an evaluation of 2d, 3d perspective and 3d stereoscopic displays
GD'11 Proceedings of the 19th international conference on Graph Drawing
Imbalance is fixed parameter tractable
Information Processing Letters
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry: Theory and Applications
Hi-index | 5.23 |
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider three-dimensional orthogonal drawings in the general position model; here no two vertices are in a common grid-plane. Minimising the number of bends in an orthogonal drawing is an important aesthetic criterion, and is NP-hard for general position drawings. We present an algorithm for producing general position drawings with an average of at most 2 2/7 bends per edge. This result is the best known upper bound on the number of bends in three-dimensional orthogonal drawings, and is optimal for general position drawings of K7. The same algorithm produces drawings with two bends per edge for graphs with maximum degree at most five; this is the only known non-trivial class of graphs admitting two-bend drawings.