Drawing graphs nicely using simulated annealing

By Ron Davidson, David Harel. 1996

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software (2014, methodology): “Different solutions exist: local temperatures as featured in GEM [5], adaptive cooling as featured in Yifan Hu [7] or simulated annealing [6].”
Mining communities and their relationships in blogs: A study of online hate groups (2007, methodology): “A type of graph layout algorithm called spring embedder, also known as force-directed method (Davidson and Harel, 1996; Eades, 1984; Fruchterman and Reingold, 1991; Kamada and Kawai, 1989) has been widely used to visualize networks.”
Geometry-Based Edge Clustering for Graph Visualization (2008, background): “According to different aesthetic criteria or specific requirements, appropriate energy models [4, 8, 20, 17] can be formulated.”
A Multilevel Algorithm for Force-Directed Graph Drawing (2000, unknown): “This idea, drawn from a graph drawing algorithm based on simulated annealing and due to Davidson & Harel, [3], allows large movements (high temperaturé ) at the beginning of the iterations but progressively reduces the maximum movement as the algorithm proceeds (and the temperature falls).”
A survey of two-dimensional graph layout techniques for information visualisation (2013, result): “The temperature is therefore adaptive to the state of the graph and, because of this, differs from cooling schedules such as those simulated annealing.(31) The quality of the layout should be similar to those of Fruchterman and Reingold and Kamada and Kawai (‘Energy-based approaches’).”
Dynamic Network Visualization1 (2005, background): “American Journal of Sociology PROOF 10 all hinder readability of the graph (Davidson and Harel 1996).”
Graph Visualization and Navigation in Information Visualization: A Survey (2000, methodology): “Spring layouts have been used successfully to produce wellbalanced layout for graphs.”
Cognitive Measurements of Graph Aesthetics (2002, methodology): “Each trial entailed generating a graph drawing using spring forces and simulated annealing [5].”
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (2004, background): “In practice, classical forcedirected algorithms like [5, 12, 6, 4] are not well suited for drawing large graphs containing many thousands of vertices, since their worst case running time is at least quadratic.”
Energy Models for Graph Clustering (2007, unknown): “For example, the classic models of Eades [16], Fruchter-man and Reingold [20], and Davidson and Harel [13] enforce uniform (or other given) edge lengths, which often prevents the separation of clusters.”
Simulated Annealing (1989, unknown): “These are summarized nicely by Davidson and Harel [1]:”
Network Visualization by Semantic Substrates (2006, background): “Variations are sometimes called spring-embedding to describe the connections between connected pair of nodes ([23], [24]) or simulated annealing, which alludes to the process of heating and cooling metals ([9], [20]).”
Efficient, High-Quality Force-Directed Graph Drawing (2006, background): “, [19]) of force-directed algorithms allows large movements (large step length) at the beginning of the iterations, but the step length reduces as the algorithm progresses.”
Spring Embedders and Force Directed Graph Drawing Algorithms (2012, methodology): “The 1997 algorithm of Davidson and Harel [13] adds additional constraints to the traditional force-directed approach in explicitly aiming to minimize the number of edge-crossings and keeping vertices from getting too close to non-adjacent edges.”