A multi-scale algorithm for drawing graphs nicely Original Research Article

We describe a multi-scale approach to the problem of drawing undirected graphs “nicely”, with the straight-line edge convention. 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 quite easily with very large graphs; some of our examples contain over 1000 vertices.