Some Modifications of Sugiyama Approach

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 366-367 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_36).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-36151-0_36
Classifications:G Algorithms and Complexity > G.700 Layering
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.210 Bends
P Styles > P.480 Layered
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:322

Repository Staff Only: item control page

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.