article

Free access

Drawing graphs nicely using simulated annealing

Authors:

David HarelAuthors Info & Claims

ACM Transactions on Graphics (TOG), Volume 15, Issue 4

Pages 301 - 331

https://doi.org/10.1145/234535.234538

Published: 01 October 1996 Publication History

Abstract

The paradigm of simulated annealing is applied to the problem of drawing graphs “nicely.” Our algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of the criteria can be changed. For graphs of modest size it produces good results, competitive with those produced by other methods, notably, the “spring method” and its variants.

References

[1]

BERGE, C. 1973. Graphs and Hypergraphs. North-Holland, Amsterdam.]]

Digital Library

[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.]]

Digital Library

[5]

DI BATTISTA, G., LADES, 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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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. MirS: Visual specification of security. IEEE Trans. Softw. Eng. 16, 1185-1197.]]

Digital Library

[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.]]

Digital Library

[17]

OHNSON, 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.)]]

Digital Library

[20]

KAMADA, T. AND KAWAI, S. 1989. An algorithm for drawing general undirected graphs. Inf. Proc. Lett. 31, 7-15.]]

Digital Library

[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 tARTS, E. H. L. 1987. Simulated Annealing: Theory and Applications, D. Reidel, Dordrecht.]]

Digital Library

[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.]]

Digital Library

[24]

MAKINEN, E. 1990. How to draw a hypergraph. Int. J. Comput. Math. 34, 177-185.]]

[25]

MANNING, g. AND ATALLAH, M.g. 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. Equa-tion 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.]]

Digital Library

[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.]]

Digital Library

[29]

TUTTE, W. T. 1963. How to draw a graph. In Proceedings of the London Mathematical Society 13, 743-768.]]

Cited By

Chabot M(2030)Indices de stabilité financière et dynamique des réseaux financiers en EuropeRevue économique10.3917/reco.pr2.0162Pub. anticipées:7(703-744)Online publication date: 31-Jan-2030
https://doi.org/10.3917/reco.pr2.0162
Osborne MSimons AMolano GTolentino BSingh AArismendi GAlberto FNuzhdin S(2024)Investigating the relationship between microbial network features of giant kelp “seedbank” cultures and subsequent farm performancePLOS ONE10.1371/journal.pone.029574019:3(e0295740)Online publication date: 27-Mar-2024
https://doi.org/10.1371/journal.pone.0295740
Liu YZhou YYang FLi S(2024)A grammar-based layout method for graph modelsInternational Conference on Algorithm, Imaging Processing, and Machine Vision (AIPMV 2023)10.1117/12.3014367(11)Online publication date: 9-Jan-2024
https://doi.org/10.1117/12.3014367
Show More Cited By

Index Terms

Drawing graphs nicely using simulated annealing

Recommendations

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Abstract
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs. More specifically, we discuss planar (geometric) automorphisms, ...
Drawing Planar Graphs
WALCOM: Algorithms and Computation
Abstract
A graph is planar if it can be drawn or embedded in the plane so that no two edges intersect geometrically except at a vertex to which they are both incident. A plane graph is a planar graph with a fixed planar embedding in the plane. A drawing ...
Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Graphics

ACM Transactions on Graphics Volume 15, Issue 4

Oct. 1996

112 pages

ISSN:0730-0301

EISSN:1557-7368

DOI:10.1145/234535

Editor:
Andrew Glassner
Microsoft Research, Redmond, WA

Issue’s Table of Contents

Copyright © 1996 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1996

Published in TOG Volume 15, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

358
Total Citations
View Citations
4,028
Total Downloads

Downloads (Last 12 months)358
Downloads (Last 6 weeks)27

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chabot M(2030)Indices de stabilité financière et dynamique des réseaux financiers en EuropeRevue économique10.3917/reco.pr2.0162Pub. anticipées:7(703-744)Online publication date: 31-Jan-2030
https://doi.org/10.3917/reco.pr2.0162
Osborne MSimons AMolano GTolentino BSingh AArismendi GAlberto FNuzhdin S(2024)Investigating the relationship between microbial network features of giant kelp “seedbank” cultures and subsequent farm performancePLOS ONE10.1371/journal.pone.029574019:3(e0295740)Online publication date: 27-Mar-2024
https://doi.org/10.1371/journal.pone.0295740
Liu YZhou YYang FLi S(2024)A grammar-based layout method for graph modelsInternational Conference on Algorithm, Imaging Processing, and Machine Vision (AIPMV 2023)10.1117/12.3014367(11)Online publication date: 9-Jan-2024
https://doi.org/10.1117/12.3014367
van Wageningen SMchedlidze TTelea A(2024)An Experimental Evaluation of Viewpoint‐Based 3D Graph DrawingComputer Graphics Forum10.1111/cgf.1507743:3Online publication date: 6-Jun-2024
https://doi.org/10.1111/cgf.15077
Khan BJohnstone MCreighton D(2024)A Many-objective Evolutionary Algorithm Approach for Graph Visualization2024 IEEE International Systems Conference (SysCon)10.1109/SysCon61195.2024.10553494(1-7)Online publication date: 15-Apr-2024
https://doi.org/10.1109/SysCon61195.2024.10553494
Mooney GPurchase HWybrow MKobourov S(2024)The Multi-Dimensional Landscape of Graph Drawing Metrics2024 IEEE 17th Pacific Visualization Conference (PacificVis)10.1109/PacificVis60374.2024.00022(122-131)Online publication date: 23-Apr-2024
https://doi.org/10.1109/PacificVis60374.2024.00022
Afxenti STomazou MTsouloupas GLambrianides APantzaris MSpyrou G(2024)List2Net: Linking multiple lists of biological data in a network contextComputational and Structural Biotechnology Journal10.1016/j.csbj.2023.11.02023(10-21)Online publication date: Dec-2024
https://doi.org/10.1016/j.csbj.2023.11.020
Ehlers HVilledieu ARaidou RWu H(2024)Improving readability of static, straight-line graph drawingsComputers and Graphics10.1016/j.cag.2023.09.010116:C(448-463)Online publication date: 4-Mar-2024
https://dl.acm.org/doi/10.1016/j.cag.2023.09.010
Centomo ERoner LSalvatori MPedrini PRomano A(2023)Rare and Hungry: Feeding Ecology of the Golden Alpine Salamander, an Endangered Amphibian in the AlpsAnimals10.3390/ani1313213513:13(2135)Online publication date: 28-Jun-2023
https://doi.org/10.3390/ani13132135
Dib FRodgers P(2023)Graph drawing using JayaPLOS ONE10.1371/journal.pone.028774418:6(e0287744)Online publication date: 27-Jun-2023
https://doi.org/10.1371/journal.pone.0287744
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents