Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs

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.

• Type: Conference
• Year: 2004
• Where: GD
• Authors: Carsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl
• Keywords: Dynamic Stability, GD 2004, Hierarchical Graphs, Layout Quality