Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

GD
2004
Springer

favoriteEmaildiscussreport

117views Computer Graphics» more GD 2004»

Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs

13 years 9 months ago

Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs

Download rw4.cs.uni-sb.de

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.

Carsten Görg, Peter Birke, Mathias Pohl, Step

Real-time Traffic

Dynamic Stability | GD 2004 | Hierarchical Graphs | Layout Quality |

claim paper

Related Content

» Orthogonal Drawings of SeriesParallel Graphs with Minimum Bends

» Orthogonal Drawings of Plane Graphs without Bends

» How to draw the minimum cuts of a planar graph

» Online Dynamic Graph Drawing

» Coherent TimeVarying Graph Drawing with MultifocusContext Interaction

» A Celtic Framework for Knots and Links

» A New Approach for Visualizing UML Class Diagrams

» TimeRadarTrees Visualizing Dynamic Compound Digraphs

» Spatial Logics for Bigraphs

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	GD
Authors	Carsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl

Comments (0)