Advertisement

Radial Coordinate Assignment for Level Graphs

  • Christian Bachmaier
  • Florian Fischer
  • Michael Forster
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3595)

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.

Keywords

Block Graph Level Graph Edge Crossing Hierarchical Graph Radial Level 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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/
  2. 2.
    Brandes, U., Kenis, P., Wagner, D.: Communicating centrality in policy network drawings. IEEE Transact. Vis. Comput. Graph. 9(2), 241–253 (2003)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications 5, 10–36 (1992)MathSciNetzbMATHGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Gravisto. Graph Visualization Toolkit. University of Passau, http://www.gravisto.org/
  7. 7.
    Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  8. 8.
    Reggiani, M.G., Marchetti, F.E.: A proposed method for representing hierarchies. IEEE Transact. Systems, Man, and Cyb. 18(1), 2–8 (1988)CrossRefGoogle Scholar
  9. 9.
    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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christian Bachmaier
    • 1
  • Florian Fischer
    • 2
  • Michael Forster
    • 3
  1. 1.University of KonstanzKonstanzGermany
  2. 2.Projective Software GmbHMunichGermany
  3. 3.National ICT AustraliaEveleighAustralia

Personalised recommendations