A Fast Heuristic for Hierarchical Manhattan Layout

A fast heuristic for the layout of directed graphs according to Manhattan convention is presented. Nodes are placed into layers. Edges consist of sequences of vertical and horizontal segments. Sharing of segments is allowed in certain situations. The algorithm is an extension of the hierarchical layout method [11, 15] that includes crossing reduction and emphasis on a uniform edge orientation. Compared to the original algorithm, the time overhead is O(n + ek) where n, e and k are the number of nodes, of edges, and the maximal number of line rows between two layers of nodes. It produces drawings where each edge has at most four bends.

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

[2]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[4]  Avi Wigderson,et al.  Rectilinear Graphs and their Embeddings , 1985, SIAM J. Comput..

[5]  Michael Himsolt,et al.  GraphEd: a Graphical Platform for the Implementation of Graph Algorithms , 1994, GD.

[6]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[7]  Charlotte Wieners-Lummer,et al.  Manhattan channel routing with good theoretical and practical performance , 1990, SODA '90.

[8]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[9]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

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

[11]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[12]  Paul G. Sorenson,et al.  Towards the Automatic Generation of Software Diagrams , 1991, IEEE Trans. Software Eng..

[13]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[14]  Frank Thomson Leighton,et al.  An approximation algorithm for manhattan routing , 1983, STOC '83.

[15]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.