Drawing graphs nicely using simulated annealing
Drawing graphs nicely using simulated annealing
复制标题
DOI:
10.1145/234535.234538
复制
发表时间:
1996-10-01
影响因子:
6.2
通讯作者:
Harel, D
中科院分区:
文献类型:
--
作者:
Davidson, R;Harel, D
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.