Logo

Login | Create Account

Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs

Görg, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan (2004) Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs. [Conference Paper]

Full text not available from this repository.

Abstract

In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of examples.

Item Type:Conference Paper
Classifications:P Styles > P.600 Poly-line > P.600.300 Mainly Orthogonal
M Methods > M.300 Dynamic / Incremental / Online
P Styles > P.480 Layered
ID Code:590
Deposited By:Selbach, Anna
Deposited On:19 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=228

Repository Staff Only: item control page

References

1. O. Bastert and C. Matuszewski. Layered drawings of digraphs. In Drawing Graphs [11]. Springer, 2001.

2. U. Brandes, M. Eiglsperger, M. Kaufmann, and D. Wagner. Sketch-Driven Orthogonal Layout. In Proc. of Graph Drawing of 2002. Springer LNCS 2528:1-11, 2002.

3. U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Proc. of Graph Drawing 1997. Springer LNCS 1353:236-247, 1997.

4. J. Branke. Dynamic graph drawing. In Drawing Graphs [11]. Springer, 2001.

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. C. Collberg, S. G. Kobourov, J. Nagra, J. Pitts, and K. Wampler. A system for graph-based visualization of the evolution of software. In Proc. of ACM Symposium on Software Visualization SOFTVIS'03, San Diego, 2003. ACM SIGGRAPH.

7. S. Diehl and C. Görg. Graphs, They are Changing - Dynamic Graph Drawing for a Sequence of Graphs. In Proceedings of Graph Drawing 2002 Springer LNCS 2528:23-30, 2002.

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

9. M. Eiglsperger and M. Kaufmann. Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. In Proceedings of Graph Drawing 2001. Springer LNCS 2265:124-138, 2002.

10. C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. Yee. GraphAEL: Graph Animations with Evolving Layouts. In Proc. of Graph Drawing 1995. Springer LNCS 2912:98-110, 2003.

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

12. S. C. North. Incremental Layout in DynaDAG. In Proc. of Graph Drawing 1995. Springer LNCS 1027:409-418, 1996.

13. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In Proceedings of Graph Drawing 1995. Springer LNCS 1027:254-266, 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.