Some Modifications of Sugiyama Approach
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2528)
We present a graph drawing algorithm that was developed as an extension of the hierarchical layout method of Sugiyama . The main features of the algorithm are that the edges are orthogonal and that each edge has at most two bends.
- 3.G. Sander, “Graph layout through the VCG tool”, DIMACS Intern. Workshop, GD’94. LNCS. 894, 1995, pp. 194–205.Google Scholar
© Springer-Verlag Berlin Heidelberg 2002