Upward Planarization Layout

Chimani, Markus and Gutwenger, Carsten and Mutzel, Petra and Wong, Hoi-Ming (2010) Upward Planarization Layout. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 94-106(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_11).

Full text not available from this repository.

Abstract

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-11805-0_11
Classifications: P Styles > P.840 Upward
M Methods > M.500 Layered
G Algorithms and Complexity > G.840 Planarization
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1075

Actions (login required)

View Item View Item