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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brandt, A., “Multilevel computations of integral transforms and particle interactions with oscillatory kernels”, Computer Physics Communications 65 (1991), 24–38. 263
Brandt, A., “Multigrid Methods in Lattice Field Computations”, Nuclear Physics B (Proc. Suppl.) 26 (1992), 137–180. 263
Davidson, R., and D. Harel, “Drawing Graphs Nicely Using Simulated Annealing”, ACM Transactions on Graphics 15 (1996), 301–331. (Preliminary version: Technical Report, The Weizmann Institute of Science, 1989.) 262, 262, 262, 264, 269, 276
Di Battista, G., P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, NJ, 1999. 262
Eades, P., “A Heuristic for Graph Drawing”,Cong. Numer. 42 (1984), 149–160. 262, 262, 276
Fruchterman, T.M.G., and E. Reingold, “Graph Drawing by Force-Directed Placement”, Software-Practice & Experience 21 (1991), 1129–1164. 262, 276
Hadany, R., Harel, D. and Y. Koren, in preparation. 263, 269, 277
Harel, D., and M. Sardas, “Randomized Graph Drawing with Heavy-Duty Preprocessing”, J. Visual Lang. and Comput. 6 (1995), 233–253. 262, 262, 263, 277
Kamada, T., and S. Kawai, “An Algorithm for Drawing General Undirected Graphs”, Inf. Proc. Lett. 31 (1989), 7–15. 262, 276
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hadany, R., Harel, D. (1999). A Multi-Scale Algorithm for Drawing Graphs Nicely. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_26
Download citation
DOI: https://doi.org/10.1007/3-540-46784-X_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66731-5
Online ISBN: 978-3-540-46784-7
eBook Packages: Springer Book Archive