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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
North, S. C., & Woodhull, G. (2002). Online hierarchical graph drawing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2265, 232–246. https://doi.org/10.1007/3-540-45848-4_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
