Logo

Login | Create Account

Graphs, They Are Changing -Dynamic Graph Drawing for a Sequence of Graphs

Diehl, Stephan and Görg, Carsten (2002) Graphs, They Are Changing -Dynamic Graph Drawing for a Sequence of Graphs. [Conference Paper]

Full text not available from this repository.

Abstract

In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We introduce several general adjustment strategies and give examples of these strategies in the context of force-directed graph layout. Finally some results from our first prototype implementation are discussed.

Item Type:Conference Paper
Classifications:M Methods > M.999 Others
M Methods > M.400 Force-directed / Energy-based
M Methods > M.300 Dynamic / Incremental / Online
ID Code:266
Deposited By:Martinez Leon, Victoria
Deposited On:30 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2528&spage=23

Repository Staff Only: item control page

References

1. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Computer Science. Springer-Verlag, 1997.

2. Ulrik Brandes. Drawing on physical analogies. In Drawing Graphs [11]. 2001.

3. Jürgen Branke. Dynamic graph drawing. In Drawing Graphs [11]. 2001.

4. S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In Proceedings of 6th International Symposium on Garph Drawing GD '98. Springer LNCS 1457, 1998.

5. R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and st-digraphs. SIAM Journal on Computing, 24(5), 1995.

6. S. Diehl, C. Görg, and A. Kerren. Foresighted Graphlayout. Technical Report A/02/2000, FR 6.2 - Informatik, University of Saarland, December 2000. http://www.cs.uni-sb.de/tr/FB14.

7. Stephan Diehl, Carsten Görg, and Andreas Kerren. Preserving the Mental Map using Foresighted Layout. In Proceedings of Joint Eurographics - IEEE TCVG Symposium on Visualization VisSym'01. Springer Verlag, 2001.

8. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42, 1984.

9. C. Friedrich and M.E. Houle. Graph Drawing im Motion II. In Proceedings of Graph Drawing 2001. Springer LNCS (to appear), 2001.

10. M.R. Garey and D.S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Company, 1979.

11. M. Kaufmann and D. Wagner, editors. Drawing Graphs - Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer-Verlag, 2001.

12. K.A. Lyons, H. Meijer, and D. Rappaport. Cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1), 1998.

13. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout Adjustment and the Mental Map. Journal of Visual Languages and Computing, 6(2): 183-210, 1995.

14. A. Papakostas and I.G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11), 1998.

15. H.C. Purchase, R.F. Cohen, and M. James. Validating graph drawing aesthetics. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Computer Science. Springer-Verlag, 1996.

16. G. Sander. Visualization Techniques for Compiler Construction. Dissertation (in german), University of Saarland, Saarbrücken (Germany), 1996.

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.