Drawing Graphs Nicely Using Simulated Annealing

Drawing Graphs Nicely Using Simulated Annealing (1996)

by Ron Davidson , David Harel

Citations:

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Drawing Graphs Nicely Using Simulated Annealing	user correction - Legacy Corrections
AUTHOR NAME	Ron Davidson	user correction - Legacy Corrections
AUTHOR AFFIL	The Weizmann Institute of Science; Simulated	user correction - Legacy Corrections
AUTHOR NAME	David Harel	user correction - Legacy Corrections
AUTHOR AFFIL	The Weizmann Institute of Science; Simulated	user correction - Legacy Corrections
ABSTRACT	The paradigm of simulated annealing is applied to the problem of drawing graphs "nicely." Our algorithm deals with general graphs with straigh-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.	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	28 found	ParsCit 1.0