Online Hierarchical Graph Drawing

North, Stephen and Woodhull, Gordon (2002) Online Hierarchical Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 232-246(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_19).

Full text not available from this repository.

Abstract

We propose a heuristic for dynamic hierarchical graph drawing. Applications include incremental graph browsing and editing, display of dynamic data structures and networks, and browsing large graphs. The heuristic is an on-line interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are incrementally stable and readable through long editing sequences. We measured the performance of a prototype implementation.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_19
Classifications: M Methods > M.500 Layered
G Algorithms and Complexity > G.700 Layering
M Methods > M.300 Dynamic / Incremental / Online
P Styles > P.480 Layered
URI: http://gdea.informatik.uni-koeln.de/id/eprint/494

Actions (login required)

View Item View Item