论文信息 - A multi-scale algorithm for drawing graphs nicely

A multi-scale algorithm for drawing graphs nicely

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.

David Harel | Ronny Hadany

[1] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .

[2] David Harel,et al. Drawing graphs nicely using simulated annealing , 1996, TOGS.

[3] David Harel,et al. Randomized Graph Drawing with Heavy-Duty Preprocessing , 1995, J. Vis. Lang. Comput..

[4] A. Brandt. Multilevel computations of integral transforms and particle interactions with oscillatory kernels , 1991 .

[5] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[6] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[7] Edward M. Reingold,et al. Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[8] W. T. Tutte. How to Draw a Graph , 1963 .

[9] A. Brandt. Multigrid methods in lattice field computations , 1992, hep-lat/9204014.

[10] David Harel,et al. A fast multi-scale method for drawing large graphs , 2000, AVI '00.

[11] Uri Zwick,et al. All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).