Logo

Login | Create Account

Graphael: A System for Generalized Force-Directed Layouts

Forrester, David and Kobourov, Stephen G. and Navabi, Armand and Wampler, Kevin and Yee, Gary V. (2004) Graphael: A System for Generalized Force-Directed Layouts. [Conference Paper]

Full text not available from this repository.

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.

Item Type:Conference Paper
Classifications:S Software and Systems > S.001 General
ID Code:617
Deposited By:Selbach, Anna
Deposited On:21 Jul 2005
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=3383&spage=454

Repository Staff Only: item control page

References

1. D. Auber. Tulip - a huge graph visualization framework. In M. Jünger and P. Mutzel, editors, Graph Drawing Software, pages 105-126. Springer-Verlag, 2003.

2. V. Batagelj and A. Mrvar. Pajek - analysis and visualization of large networks. In M. Jünger and P. Mutzel, editors, Graph Drawing Software, pages 77-103. Springer-Verlag, 2003.

3. S. S. Bridgeman, A. Garg and R. Tamassia. A graph drawing and transaction service on the www. International Journal on Computational Geometry and Application, 9(4-5):419-446, 1999.

4. T. Dwyer and P. Eckersley. Wilmascope - a 3d graph visualization system. In M. Jünger and P. Mutzel, editors, Graph Drawing Software, page 55-75. Springer-Verlag, 2003.

5. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph animations with evolving layouts. In 11th Symposium on Graph Drawing, pages 98-110, 2003.

6. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. Exploring the computing literature using temporal graph visualization. In Visualization and Data Analysis, pages 45-56, 2004.

7. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Softw. Pract. Exper., 21(11):1129-1164, 1991.

8. P. Gajer and S. G. Kobourov. GRIP: Graph drawing with intelligent placement. Journal of Graph Algorithms and Applications, 6(3):203-224, 2002.

9. M. Jünger and P. Mutzel, editors. Graph Drawing Software . Springer-Verlag, 2003.

10. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inf. Process. Lett., 31(1):7-15, 1989.

11. S. G. Kobourov and K. Wampler. Non Euclidean spring embedders. In 10th Annual IEEE Symposium on Information Visualization (Info Vis). To appear in 2004.

12. J. Lamping, R. Rao, and P. Pirolli. A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In Proceedings of the SIGCHI conference on Human factors in computing systems, pages 401-408, 1995.

13. S. B. Seidman. Network structure and minimum degree. Social Networks, 5:269-287, 1983.

14. R. Wiese, M. Eiglsperger, and M. Kaufmann. yfiles - visualization and automatic layout of graphs. In M. Jünger and P. Mutzel, editors, Graph Drawing Software, pages 173-192. Springer-Verlag, 2003.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.