Affiliation:
1. Weizmann Institute of Science, Rehovot, Israel
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference29 articles.
1. BERGE C. 1973. Graphs and Hypergraphs. North-Holland Amsterdam.]] BERGE C. 1973. Graphs and Hypergraphs. North-Holland Amsterdam.]]
2. DE BOOR C. 1978. A Practical Guide to Splines. Springer-Verlag New York.]] DE BOOR C. 1978. A Practical Guide to Splines. Springer-Verlag New York.]]
3. Computer aided layout of entity relationship diagrams
4. 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.]] 10.1016/0925-7721(94)00014-X 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.]] 10.1016/0925-7721(94)00014-X
Cited by
255 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献