Abstract
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing the vertex ordering, and therefore without introducing new edge crossings. Edges are drawn as sequences of spiral segments with at most two bends.
Part of this work was done at the University of Passau.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications (2005), To appear. Preprint under http://www.infosun.fmi.uni-passau.de/~chris/
Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE Transact. Vis. Comput. Graph. 9(2), 241–253 (2003)
Brandes, U., Köpf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 31–44. Springer, Heidelberg (2002)
Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications 5, 10–36 (1992)
Eades, P., Feng, Q.-W., Lin, X.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 113–128. Springer, Heidelberg (1997)
Gravisto. Graph Visualization Toolkit. University of Passau, http://www.gravisto.org/
Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
Reggiani, M.G., Marchetti, F.E.: A proposed method for representing hierarchies. IEEE Transact. Systems, Man, and Cyb. 18(1), 2–8 (1988)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems, Man, and Cyb. 11(2), 109–125 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmaier, C., Fischer, F., Forster, M. (2005). Radial Coordinate Assignment for Level Graphs. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_41
Download citation
DOI: https://doi.org/10.1007/11533719_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)