Some Modifications of Sugiyama Approach

  • Danil E. Baburin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)

Abstract

We present a graph drawing algorithm that was developed as an extension of the hierarchical layout method of Sugiyama [4]. The main features of the algorithm are that the edges are orthogonal and that each edge has at most two bends.

References

  1. 1.
    I. A. Lisitsyn, V.N. Kasyanov, “Higres-Visualization system for Clustered Graphs and Graph Algorithms”, Graph Drawing, LNCS 1731, Czech Republic 1999, pp. 82–89CrossRefGoogle Scholar
  2. 2.
    G. Sander, “A Fast Heuristic for Hierarchical Manhattan Layout”, Graph Drawing, LNCS 1027, Germany 1995, pp. 447–458CrossRefGoogle Scholar
  3. 3.
    G. Sander, “Graph layout through the VCG tool”, DIMACS Intern. Workshop, GD’94. LNCS. 894, 1995, pp. 194–205.Google Scholar
  4. 4.
    K. Sugiyama, S. Tagawa, M. Toda, “Methods for Visual Understanding of Hierarchical systems”, IEEE Trans. Sys., Man, and Cybernetics, SMC 11(2), 1981, pp. 109–125.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Danil E. Baburin
    • 1
  1. 1.A.P. Ershov Institute of Informatics SystemsNovosibirskRussia

Personalised recommendations