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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Chimani, M., Gutwenger, C., Mutzel, P., & Wong, H. M. (2010). Upward planarization layout. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5849 LNCS, pp. 94–106). https://doi.org/10.1007/978-3-642-11805-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
