On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Journal of the ACM (JACM)
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
On the complexity of orthogonal compaction
Computational Geometry: Theory and Applications
Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing Orthogonal Drawings with the Minimum Number of Bends
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Dynamic Grid Embedding with Few Bends and Changes
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Computing Orthogonal Drawings in a Variable Embedding Setting
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
A Bayesian Paradigm for Dynamic Graph Layout
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Pitfalls of Using PQ-Trees in Automatic Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Computing a minimum-depth planar graph embedding in O(n4) time
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
The depth of a planar embedding of a graph is a measure of the topological nesting of the biconnected components of the graph in that embedding. Motivated by the intuition that lower depth values lead to better drawings, previous works proposed efficient algorithms for finding embeddings with minimum depth. We present an experimental study that shows the impact of embedding depth minimization on important aesthetic criteria and relates the effectiveness of this approach with measures of how much the graph resembles a tree or a biconnected graph. In our study, we use a well known test suite of graphs obtained from real-world applications and a randomly generated one with favorable biconnectivity properties. In the experiments we consider orthogonal drawings computed using the topology-shape-metrics approach.