Drawing graphs nicely using simulated annealing

被引:240
作者
Davidson, R
Harel, D
机构
[1] Dept. of Appl. Math. and Comp. Sci., Weizmann Institute of Science, Rehovot
来源
ACM TRANSACTIONS ON GRAPHICS | 1996年 / 15卷 / 04期
关键词
aesthetics; graph drawing; simulated annealing;
D O I
10.1145/234535.234538
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:301 / 331
页数:31
相关论文
共 30 条
  • [1] COMPUTER-AIDED LAYOUT OF ENTITY RELATIONSHIP DIAGRAMS
    BATINI, C
    TALAMO, M
    TAMASSIA, R
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 1984, 4 (2-3) : 163 - 173
  • [2] Berge C, 1973, GRAPHS HYPERGRAPHS
  • [3] BERNDT MC, 1981, PLATELETS BIOL PATHO, P43
  • [4] de Boor C., 1978, PRACTICAL GUIDE SPLI, DOI DOI 10.1007/978-1-4612-6333-3
  • [5] DIBATTISTA G, 1993, IN PRESS COMPUT GEOM
  • [6] Eades Peter, 1984, Congressus Numerantium, V42, P149, DOI DOI 10.1007/3-540-63938-1_
  • [7] GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT
    FRUCHTERMAN, TMJ
    REINGOLD, EM
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) : 1129 - 1164
  • [8] DAG - A PROGRAM THAT DRAWS DIRECTED-GRAPHS
    GANSNER, ER
    NORTH, SC
    VO, KP
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (11) : 1047 - 1062
  • [9] CROSSING NUMBER IS NP-COMPLETE
    GAREY, MR
    JOHNSON, DS
    [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03): : 312 - 316
  • [10] HAJEK B, 1985, 24TH P C DEC CONTR, P755