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.
Download to read the full chapter text
Chapter PDF
References
I. A. Lisitsyn, V.N. Kasyanov, “Higres-Visualization system for Clustered Graphs and Graph Algorithms”, Graph Drawing, LNCS 1731, Czech Republic 1999, pp. 82–89
G. Sander, “A Fast Heuristic for Hierarchical Manhattan Layout”, Graph Drawing, LNCS 1027, Germany 1995, pp. 447–458
G. Sander, “Graph layout through the VCG tool”, DIMACS Intern. Workshop, GD’94. LNCS. 894, 1995, pp. 194–205.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baburin, D.E. (2002). Some Modifications of Sugiyama Approach. In: Goodrich, M.T., Kobourov, S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36151-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-36151-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00158-4
Online ISBN: 978-3-540-36151-0
eBook Packages: Springer Book Archive