GD 2001: Graph Drawing pp 31-44 | Cite as

Fast and Simple Horizontal Coordinate Assignment

  • Ulrik Brandes
  • Boris Köpf
  • Ulrik Brandes
    • 1
  • Boris Köpf
    • 1
  1. 1.Department of Computer & Information ScienceUniversity of KonstanzKonstanzGermany
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)

Abstract

We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well with existing approaches in terms of assignment quality.

Keywords

Layered Graph Minimum Separation Vertical Alignment Bend Point Graph Drawing 
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.
Download to read the full conference paper text

References

  1. 1.
    Oliver Bastert and Christian Matuszewski. Layered drawings of digraphs. In Michael Kaufmann and Dorothea Wagner, editors, Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science, pages 104–139. Springer, 2001.CrossRefGoogle Scholar
  2. 2.
    Christoph Buchheim, Michael Jünger, and Sebastian Leipert. A fast layout algorithm for k-level graphs. Technical Report 99-368, Department of Economics and Computer Science, University of Cologne, 1999.Google Scholar
  3. 3.
    Christoph Buchheim, Michael Jünger, and Sebastian Leipert. A fast layout algorithm for k-level graphs. In Joe Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), volume 1984 of Lecture Notes in Computer Science, pages 229–240. Springer, 2001.Google Scholar
  4. 4.
    Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.Google Scholar
  5. 5.
    Peter Eades, Xuemin Lin, and Roberto Tamassia. An algorithm for drawing a hierarchical graph. International Journal of Computational Geometry & Applications, 6:145–156, 1996.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Peter Eades and Kozo Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424–437, 1990.MATHGoogle Scholar
  7. 7.
    Michael Fröhlich and Mattias Werner. The graph visualization system daVinci —a user interface for applications. Technical Report 5/94, Department of Computer Science, University of Bremen, 1994.Google Scholar
  8. 8.
    Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, and Kiem-Phong Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214–230, 1993.CrossRefGoogle Scholar
  9. 9.
    Emden R. Gansner and Stephen C. North. An open graph visualization system and its applications to software engineering. Software—Practice and Experience, 30(11):1203–1233, 2000.MATHCrossRefGoogle Scholar
  10. 10.
    Emden R. Gansner, Stephen C. North, and Kiem-Phong Vo. DAG — A program that draws directed graphs. Software—Practice and Experience, 17(1):1047–1062, 1988.CrossRefGoogle Scholar
  11. 11.
    Lois M. Haibt. A program to draw multilevel flow charts. In Proceedings of the Western Joint Computer Conference, volume 15, pages 131–137, 1959.Google Scholar
  12. 12.
    Xuemin Lin and Peter Eades. Area minimization for grid visibility representation of hierarchically planar graphs. In Takao Asano, Hiroshi Imai, Der-Tsai Lee, Shinichi Nakano, and Takeshi Tokuyama, editors, Proceedings of the 5th International Conference on Computing and Combinatorics (COCOON’ 99), volume 1627 of Lecture Notes in Computer Science, pages 92–102. Springer, 1999.Google Scholar
  13. 13.
    Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert. A library of algorithms for graph drawing. In Sue H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD’ 98), volume 1547 of Lecture Notes in Computer Science, pages 456–457. Springer, 1998.Google Scholar
  14. 14.
    Georg Sander. Graph layout through the VCG tool. In Roberto Tamassia and Ioannis G. Tollis, editors, Proceedings of the DIMACSInternational Workshop on Graph Drawing (GD’ 94), volume 894 of Lecture Notes in Computer Science, pages 194–205. Springer, 1995.Google Scholar
  15. 15.
    Georg Sander. A fast heuristic for hierarchical Manhattan layout. In Franz J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD’ 95), volume 1027 of Lecture Notes in Computer Science, pages 447–458. Springer, 1996.Google Scholar
  16. 16.
    Georg Sander. Graph layout for applications in compiler construction. Theoretical Computer Science, 217(2):175–214, 1999.MATHCrossRefGoogle Scholar
  17. 17.
    Kozo Sugiyama and Kazuo Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876–892, 1991.CrossRefMathSciNetGoogle Scholar
  18. 18.
    Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125, February 1981.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Personalised recommendations

We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media, advertising and analytics partners in accordance with our Privacy Statement. You can manage your preferences in Manage Cookies.

Close
OK
Manage Cookies