Dynamic graph drawing of sequences of orthogonal and hierarchical graphs

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 228-238

  Görg, Carsten ^a   Birke, Peter ^a   Pohl, Mathias ^a   Diehl, Stephan ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMATION; GRAPH THEORY; MAPPING;

DYNAMIC GRAPH DRAWING; DYNAMIC STABILITY; HIERARCHICAL GRAPHS; ORTHOGONAL GRAPHS;

DRAWING (GRAPHICS);

DYNAMIC GRAPH DRAWING; HIERARCHICAL GRAPHS; INTERMEDIATE RESULTS; LAYOUT QUALITY; MENTAL MAPS; NOVEL ALGORITHM; PARAMETERIZED;

EID: 24144460578     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

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 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, 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 2003. 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.