Mixed Upward Planarization - Fast and Robust

Siebenhaller, Martin and Kaufmann, Michael (2006) Mixed Upward Planarization - Fast and Robust. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 522-523 (Official URL: http://dx.doi.org/10.1007/11618058_52).

Full text not available from this repository.

Abstract

In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where such edges denote a hierarchical structure. [part of Introduction]

Item Type:Conference Poster
Additional Information:10.1007/11618058_52
Classifications:P Styles > P.840 Upward
M Methods > M.700 Planarization-based
ID Code:732

Repository Staff Only: item control page

References

U. Brandes and B. Köpf: Fast and Simple Horizontal Coordinate Assignment. Proceedings of Graph Drawing 2001, Springer LNCS 2265, pp. 31-44, 2001.

M. Eiglsperger, M. Kaufmann and F. Eppinger: An Approach for Mixed Upward Planarization. J. Graph Algorithms Appl., 7(2): pp. 203-220, 2003.

M. Eiglsperger, M. Siebenhaller and M. Kaufmann: An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. Proceedings of Graph Drawing 2004, Springer LNCS 3383, pp. 155-166, 2005.

K. Sugiyama, S. Tagawa and M. Toda: Methods for Visual Understanding of Hierarchical System Structures. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2): pp. 109-125, 1981.