A Multi-Scale Algorithm for Drawing Graphs Nicely

Authors:
Ronny Hadany;David Harel
Affiliations:
-;-
Venue:
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1999

Citing 4
Cited 6

An algorithm for drawing general undirected graphs

Information Processing Letters
Graph drawing by force-directed placement

Software—Practice & Experience
Drawing graphs nicely using simulated annealing

ACM Transactions on Graphics (TOG)
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs

A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Multi-scale Method for Drawing Large Graphs

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
FADE: Graph Drawing, Clustering, and Visual Abstraction

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graph visualization with latent variable models

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Continuous awareness: a visual mobile approach

Proceedings of the 5th International Symposium on Visual Information Communication and Interaction
Continuous awareness: A visual mobile approach

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a multi-scale approach to the problem of drawing undirected straight-line graphs "nicely". In contrast to conventional global/dynamic algorithms, we employ increasingly coarser-scale representations of the graph, together with a simple local organization scheme, without imposing formal criteria on the quality of the picture at large. Our algorithm can deal easily with very large graphs; some of our examples contain over 1000 vertices.