Abstract
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
The full version of the paper is available at ftp://ftp.research.microsoft.com/pub/tr/TR-2007-72.pdf. GLEE can be downloaded at http://research.microsoft.com/~levnach/GLEEWebPage. htm.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Drawing graphs with GLEE technical report, Lev Nachmanson, George Robertson and Bongshin Lee, ftp://ftp.research.microsoft.com/pub/tr/TR-2007-72.pdf
Graphviz todo list (December 22, 2005), http://www.graphviz.org/doc/todo.html
Abello, J., Gansner, E.R.: Short and smooth polygonal paths. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 151–162. Springer, Heidelberg (1998)
Barth, W., Jünger, M., Mutzel, P.: Simple and efficient bilayer cross counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 130–141. Springer, Heidelberg (2002)
Brandes, U., Köpf, B.: Fast and simple horizontal coordinate assignment. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 31–44. Springer, Heidelberg (2002)
Coffman, E.G., Graham, R.L.: Optimal Scheduling for Two-Processor Systems. Acta Informatica 1(3), 200–213 (1972)
Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.: Implementing a general-purpose edge router. In: Di Battista, G. (ed.) Graph Drawing, Rome, Italy, September 18-20, 1997, pp. 262–271. Springer, Heidelberg (1998)
Eiglsperger, M., Siebenhaller, M., Kaufmann, M.: An efficient implementation of sugiyama’s algorithm for layered graph drawing. In: Pach, J. (ed.) Graph Drawing, New York, pp. 155–166. Springer, Heidelberg (2004)
Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A Technique for Drawing Directed Graphs. IEEE Transactions on Software Engineering 19(3), 214–230 (1993)
Goodrich, M.T., Kobourov, S.G. (eds.): GD 2002. LNCS, vol. 2528. Springer, Heidelberg (2002)
Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 98–109. Springer, Heidelberg (2002)
Lutterkort, D., Peters, J.: Smooth paths in a polygonal channel. In: Symposium on Computational Geometry, pp. 316–321 (1999)
Myles, A., Peters, J.: Threading splines through 3d channels. Computer-Aided Design 37(2), 139–148 (2005)
Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. Discrete Applied Mathematics 154(5), 848–860 (2006)
Nikolov, N.S., Tarassov, A., Branke, J.: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. J. Exp. Algorithmics 10(2.7) (2005)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics SMC-11(2), 109–125 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nachmanson, L., Robertson, G., Lee, B. (2008). Drawing Graphs with GLEE. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)