Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis
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.
- 1.Alberts, D., Gutwenger, C., Mutzel, P., Näher, S.: AGD-Library: A library of algorithms for graph drawing. In: Proc. Workshop on Algorithm Engineering, pp. 112–123 (1997)Google Scholar
- 4.Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEETC: IEEE Transactions on Computers 49 (2000)Google Scholar
- 10.Di Battista, G., et al: Graph Drawing Toolkit. University of Rome III, Italy, http://www.dia.uniroma3.it/~gdt/
- 21.Pizzonia, M.: Engineering of Graph Drawing Algorithms for Applications. PhD thesis, Dipartimento di Informatica e Sistemistica, University degli Studi “La Sapienza” di Roma (2001)Google Scholar