A Fast Heuristic for Hierarchical Manhattan Layout

Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 447-458(Official URL: http://dx.doi.org/10.1007/BFb0021828).

Full text not available from this repository.


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.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021828
Classifications: G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.210 Bends
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/211

Actions (login required)

View Item View Item