Abstract
The graphael system implements several traditional force-directed layout methods, as well as several novel layout methods for non-Euclidean geometries, including hyperbolic and spherical. The system can handle large graphs, using multi-scale variations of the force-directed methods. Moreover, graphael can layout and visualize graphs that evolve though time, using static views, animation, and morphing. The implementation includes a powerful interface that allows the user to put together existing algorithms and visualization techniques, and to easily add new ones. The system is written in Java and is available as a downloadable program or as an applet at http://graphael.cs.arizona.edu.
This work is supported in part by the NSF under grant ACR-0222920 and ITCDI under grant 003297.
Chapter PDF
References
Auber, D.: Tulip - a huge graph visualization framework. In: Jünger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 105–126. Springer, Heidelberg (2003)
Batagelj, V., Mrvar, A.: Pajek - analysis and visualization of large networks. In: Jünger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 77–103. Springer, Heidelberg (2003)
Bridgeman, S.S., Garg, A., Tamassia, R.: A graph drawing and translation service on the www. International Journal on Computational Geometry and Application 9(4–5), 419–446 (1999)
Dwyer, T., Eckersley, P.: Wilmascope - a 3d graph visualization system. In: Jünger, P., Mutzel, P. (eds.) Graph Drawing Software, pp. 55–75. Springer, Heidelberg (2003)
Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.: GraphAEL: Graph animations with evolving layouts. In: 11th Symposium on Graph Drawing, pp. 98–110 (2003)
Erten, C., Harding, P.J., Kobourov, S.G., Wampler, K., Yee, G.: Exploring the computing literature using temporal graph visualization. In: Visualization and Data Analysis, pp. 45–56 (2004)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129–1164 (1991)
Gajer, P., Kobourov, S.G.: GRIP: Graph drawing with intelligent placement. Journal of Graph Algorithms and Applications 6(3), 203–224 (2002)
Jünger, M., Mutzel, P.: Graph Drawing Software. Springer, Heidelberg (2003)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7–15 (1989)
Kobourov, S.G., Wampler, K.: Non-Euclidean spring embedders. In: 10th Annual IEEE Symposium on Information Visualization, InfoVis (2004) (to appear)
Lamping, J., Rao, R., Pirolli, P.: A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: Proceedings of the SIGCHI conference on Human factors in computing systems, pp. 401–408 (1995)
Seidman, S.B.: Network structure and minimum degree. Social Networks 5, 269–287 (1983)
Wiese, R., Eiglsperger, M., Kauffmann, M.: yfiles - visualization and automatic layout of graphs. In: Jünger, M., Mutzel, P. (eds.) Graph Drawing Software, pp. 173–192. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Forrester, D., Kobourov, S.G., Navabi, A., Wampler, K., Yee, G.V. (2005). Graphael: A System for Generalized Force-Directed Layouts. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)