Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 7704))
Included in the following conference series:
Abstract
We consider orthogonal upward drawings of directed acyclic graphs (DAGs) with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [10]. However, to avoid drawbacks of the Sugiyama framework we use the layer-free upward crossing minimization algorithm suggested by Chimani et al. and integrate it into the topology-shape-metric (TSM) framework introduced by Tamassia [11]. This in combination with an algorithm by Biedl and Kant [2] lets us generatecolumn-based layouts, i.e., layouts where the plane is divided into uniform-width columns and every node is assigned to a column.
We show that our column-based approach allows to generate visually appealing, compact layouts with few edge crossing and at most four bends per edge. Furthermore, the resulting layouts exhibit a high degree of symmetry and implicitly support edge bundling. We justify our approach by an experimental evaluation based on real-world examples.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Betz, G.: Theorie dialektischer Strukturen. Klostermann (2010)
Biedl, T., Kant, G.: A Better Heuristic for Orthogonal Graph Drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 24–35. Springer, Heidelberg (1994)
Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.M.: Layer-free upward crossing minimization. Journal of Experimental Algorithmics 15 (2010)
Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.M.: Upward planarization layout. Journal of Graph Algorithms and Applications 15(1), 127–155 (2011)
Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297–310. Springer, Heidelberg (1999)
Doll, C.: Automatic Layout Generation for Argument Maps. Master’s thesis, Karlsruhe Institute of Technology (February 2012)
Eades, P., Tamassia, R.: Algorithms for drawing graphs: An annotated bibliography. Tech. rep., Brown University, Providence, RI, USA (1988)
Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing 31, 601–625 (2002)
Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: IEEE Pacific Visualization Symposium, PacificVIS 2008, pp. 41–46 (2008)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11(2), 109–125 (1981)
Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16, 421–444 (1987)
Author information
Authors and Affiliations
Karlsruhe Institute of Technology (KIT), Germany
Gregor Betz, Christoph Doll, Andreas Gemsa, Ignaz Rutter & Dorothea Wagner
- Gregor Betz
You can also search for this author inPubMed Google Scholar
- Christoph Doll
You can also search for this author inPubMed Google Scholar
- Andreas Gemsa
You can also search for this author inPubMed Google Scholar
- Ignaz Rutter
You can also search for this author inPubMed Google Scholar
- Dorothea Wagner
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
Dip. di Ingegneria Elettronica e dell’Informazione, Perugia University, Italy
Walter Didimo
Dip. Informatica e Automazione, Università degli Studi Roma Tre, Via della Vasca Navale, 79, 00146, Rome, Italy
Maurizio Patrignani
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Betz, G., Doll, C., Gemsa, A., Rutter, I., Wagner, D. (2013). Column-Based Graph Layouts. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_21
Download citation
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-642-36762-5
Online ISBN:978-3-642-36763-2
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative