Drawing Graphs Nicely Using Simulated Annealing

ACM Transactions on Graphics

Volumn 15, Issue 4, 1996, Pages 301-331

  Davidson, Ron ^a   Harel, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Aesthetics; Algorithms; D.m Software : Miscellaneous; E.m Data : Miscellaneous; F.m Theory of Computation : Miscellaneous; Graph drawing; Simulated annealing; Theory

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER GRAPHICS; DRAWING (GRAPHICS); GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY;

GRAPH DRAWING; RELATIVE WEIGHTS; SPRING METHOD; STRAIGHT LINE EDGES;

SIMULATED ANNEALING;

EID: 0030264246     PISSN: 07300301     EISSN: None     Source Type: Journal    
DOI: 10.1145/234535.234538     Document Type: Article

References (29)

1. BERGE, C. 1973. Graphs and Hypergraphs. North-Holland, Amsterdam.
2. BERNARD, M. A. 1981. On the automated drawing of graphs. In Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing, 43-55.
3. DE BOOR, C. 1978. A Practical Guide to Splines. Springer-Verlag, New York.
4. BATINI, C., TALAMO, M., AND TAMASSIA, R. 1984. Computer-aided layout of entity-relationship diagrams. J. Syst. Softw. 4 163-173.
5. DI BATTISTA, G., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1993. Algorithms for drawing graphs: An annotated bibliography. Preprint, Dept. of Computer Science, Brown Univ., Providence, R.I., Nov. To appear in Comput. Geom. Theory Appl.
6. EADES, P. 1984. A heuristic for graph drawing. Cong. Numer. 42, 149-160.
7. FRUCHTERMAN, T. M. G. AND REINGOLD, E. 1991. Graph drawing by force-directed placement. Softw. Pract. Exper. 21, 1129-1164.
8. GANSNER, E. R., NORTH, S. C., AND VO, K. P. 1988. DAG - A program that draws directed graphs. Softw. - Pract. Exper. 18, 1047-1062.
9. GAREY, M. R. AND JOHNSON, D. S. 1983. Crossing number is NP-complete. SIAM J. Alg. Discrete Meth. 4, 312-316.
10. HAJEK, B. 1985. A tutorial survey of theory and applications of simulated annealing. In Proceedings of the 24th Conference on Decision and Control, 755-760.
11. HAREL, D. 1988. On visual formalisms. Commun. ACM 31, 514-530.
12. HAREL, D., LACHOVER, H., NAAMAD, A., PNUELI, A., POLITI, M., SHERMAN, R., SHTUL-TRAURING, A., AND TRAKHTENBROT, M. 1990. STATEMATE: A working environment for the development of complex reactive systems. IEEE Trans. Softw. Eng. 16, 403-414.
13. HAREL, D. AND SARDAS, M. 1995. Randomized graph drawing with heavy-duty preprocessing. J. Visual Lang. Comput. 6, 233-253.
14. HAREL, D. AND SARDAS, M. 1996. An incremental drawing algorithm for planar graphs. Algorithmica, to appear.
15. HEYDON, A., MAIMONE, M. W., TYGAR, J. D., WING, J. M., AND ZAREMSKI, A. M. 1990. Miró: Visual specification of security. IEEE Trans. Softw. Eng. 16, 1185-1197.
16. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A., AND SCHEVON, C. 1989. Optimization by simulated annealing: An experimental evaluation, Part I (Graph partitioning). Oper. Res. 37, 865-892.
17. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A., AND SCHEVON, C. 1991. Optimization by simulated annealing: An experimental evaluation, Part II (Graph coloring and number partitioning). Oper. Res. 39, 378-406.
18. JOHNSON, D. S. AND POLLACK, H. O. 1987. Hypergraph planarity and the complexity of drawing Venn diagrams. J. Graph Theory 11, 309-325.
19. KAMADA, T. 1989. Visualizing Abstract Objects and Relations. World Scientific, Teaneck, N.J., (See also On visualization of abstract objects and relations. D. Sc. Thesis, The University of Tokyo, Dec. 1988.)
20. KAMADA, T. AND KAWAI, S. 1989. An algorithm for drawing general undirected graphs. Inf. Proc. Lett. 31, 7-15.
21. KIRKPATRICK, S., GELATT JR., C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science 220, 671-680.
22. VAN LAARHOVEN, P. J. M. AND AARTS, E. H. L. 1987. Simulated Annealing: Theory and Applications, D. Reidel, Dordrecht.
23. LIPTON, R., NORTH, S., AND SANDBERG, J. 1985. A method for drawing graphs. In Proceedings of the ACM Symposium on Computational Geometry, 153-160.
24. MAKINEN, E. 1990. How to draw a hypergraph. Int. J. Comput. Math. 34, 177-185.
25. MANNING, J. AND ATALLAH, M. J. 1988. Fast detection and display of symmetry in trees. Cong. Numer. 64, 159-169.
26. METROPOLIS, N., ROSENBLUTH, A., ROSENBLUTH, M., TELLER, A., AND TELLER, E. 1953. Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1091.
27. SIARRY, P., BERGONZI, L., AND DREYFUS, G. 1987. Thermodynamic optimization of block placement. IEEE Trans. Comput. Aided Des. 6, 211-221.
28. TAMASSIA, R., DI BATTISTA, G., AND BATINI, C. 1988. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. SMC-18, 61-79.
29. TUTTE, W. T. 1963. How to draw a graph. In Proceedings of the London Mathematical Society 13, 743-768.