Column-Based Graph Layouts
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 . 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 . This in combination with an algorithm by Biedl and Kant  lets us generate column-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.
KeywordsDirected Acyclic Graph Outgoing Edge Incoming Edge Edge Segment Edge Crossing
- 1.Betz, G.: Theorie dialektischer Strukturen. Klostermann (2010)Google Scholar
- 3.Chimani, M., Gutwenger, C., Mutzel, P., Wong, H.M.: Layer-free upward crossing minimization. Journal of Experimental Algorithmics 15 (2010)Google Scholar
- 6.Doll, C.: Automatic Layout Generation for Argument Maps. Master’s thesis, Karlsruhe Institute of Technology (February 2012)Google Scholar
- 7.Eades, P., Tamassia, R.: Algorithms for drawing graphs: An annotated bibliography. Tech. rep., Brown University, Providence, RI, USA (1988)Google Scholar
- 9.Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: IEEE Pacific Visualization Symposium, PacificVIS 2008, pp. 41–46 (2008)Google Scholar