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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Görg, C., Birke, P., Pohl, M., & Diehl, S. (2004). Dynamic graph drawing of sequences of orthogonal and hierarchical graphs. In Lecture Notes in Computer Science (Vol. 3383, pp. 228–238). https://doi.org/10.1007/978-3-540-31843-9_24
Mendeley helps you to discover research relevant for your work.