Upward Planarization Layout

Recently, we presented a new practical method for upward crossing minimization [6], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straight-forward approaches for drawing such UPRs lead to quite unsatisfactory results. In this paper, we present a new algorithm for drawing UPRs that greatly improves the layout quality, leading to good hierarchal drawings with few crossings. We analyze its performance on well-known benchmark graphs and compare it with alternative approaches.

[1]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[2]  Nikola S. Nikolov,et al.  How to Layer a Directed Acyclic Graph , 2001, GD.

[3]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[4]  Petra Mutzel,et al.  An Experimental Study of Crossing Minimization Heuristics , 2003, Graph Drawing.

[5]  Nikola S. Nikolov,et al.  Graph layering by promotion of nodes , 2006, Discret. Appl. Math..

[6]  Jürgen Branke,et al.  Width-restricted layering of acyclic digraphs with consideration of dummy nodes , 2002, Inf. Process. Lett..

[7]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1998, SIAM J. Comput..

[8]  Michael Kaufmann,et al.  An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing , 2004, J. Graph Algorithms Appl..

[9]  Ioannis G. Tollis,et al.  Automatic layout of PERT diagrams with X-PERT , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[10]  Carlo Batini,et al.  Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..

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

[12]  Giuseppe Liotta,et al.  Drawing Directed Acyclic Graphs: An Experimental Study , 2000, Int. J. Comput. Geom. Appl..

[13]  Giuseppe Liotta,et al.  An Experimental Comparison of Four Graph Drawing Algorithms , 1997, Comput. Geom..

[14]  Ioannis G. Tollis,et al.  Area requirement and symmetry display of planar upward drawings , 1992, Discret. Comput. Geom..

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

[16]  Nikola S. Nikolov,et al.  A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem , 2002, Graph Drawing.

[17]  Markus Chimani,et al.  Layer-free upward crossing minimization , 2008, JEAL.

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