By graph animation we denote the problem
of drawing known sequences of graphs.
The graphs in such a sequence usually have
evolved by adding and deleting edges and nodes.
Drawing such graphs results in an additional
aesthetic criterium known as ``preserving the mental map''
or dynamic stability. We investigate generic
algorithms to draw such graph sequences as well
as metrics for dynamic stability.
New
Examples of new approach for hierarchical
and orthogonal layout.
The GANIFA-Applet uses Foresighted Layout
for animating the generation of finite automata.
Publications
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
Carsten Görg, Peter Birke, Mathias Pohl and Stephan Diehl in Proceedings of 12th International Symposium on Graph Drawing, New York City, USA, September 29 - October 2, 2004 (to appear).
Graphs, They are Changing --
Dynamic Graph Drawing for a Sequence of Graphs
Stephan Diehl and Carsten Görg
in Proceedings of
10th International Symposium on Graph Drawing,
Irvine, California, August 26-28, 2002.
Animating Algorithms Live and Post Mortem
Stephan Diehl, Carsten Görg and Andreas Kerren
in "Software Visualization", State-of-the-Art Survey, Springer LNCS 2269, 2002.
Online available from publisher, ISBN 3-540-43323-6
Preserving the Mental Map using
Foresighted Layout
Stephan Diehl, Carsten Görg and Andreas Kerren
in Proceedings of Joint Eurographics -
IEEE TCVG Symposium on Visualization, VisSym 2001, Ascona,
Switzerland, Springer Verlag, 2001.
(PDF-file)
Foresighted Graphlayout
Stephan Diehl, Carsten Görg and Andreas Kerren
Technischer Bericht A 02/00,
FB Informatik, University Saarbruecken (download)
Contact
FR 6.2 - Informatik
Universität des Saarlandes
Bau 45, Zimmer 432
Postfach 15 11 50
D-66041 Saarbrücken
GERMANY
![[EMAIL:]](http://www.rw.cdl.uni-saarland.de/projects/ganimal/graphics/email.gif)