Size- and Port-Aware Horizontal Node Coordinate Assignment

The approach by Sugiyama et al. is widely used to automatically draw directed graphs. One of its steps is to assign horizontal coordinates to nodes. Brandes and Koepf presented a method that proved to work well in practice. We extend this method to make it possible to draw diagrams with nodes that have considerably different sizes and with edges that have fixed attachment points on a node's perimeter ports. Our extensions integrate seamlessly with the original method and preserve the linear execution time.

[1]  Joaquín Aguado,et al.  Sequentially constructive concurrency A conservative extension of the synchronous model of computation , 2014, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[2]  Nikola S. Nikolov,et al.  Hierarchical Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

[3]  Georg Sander,et al.  A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[4]  Ulrik Brandes,et al.  Fast and Simple Horizontal Coordinate Assignment , 2001, GD.

[5]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Michael Jünger,et al.  A Fast Layout Algorithm for k-Level Graphs , 2000, Graph Drawing.

[7]  Reinhard von Hanxleden,et al.  Drawing layered graphs with port constraints , 2014, J. Vis. Lang. Comput..