Graph drawing by force‐directed placement
Software Practice and ExperiencePublished 1 November 1991
Thomas M. J. Fruchterman, Edward M. Reingold
Citations6,359
SJR quartileQ2
SJR score0.68
SNIP1.26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Abstract
Abstract We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Keywords
Computer Science
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
Information Processing LettersAn algorithm for drawing general undirected graphs
2,771 Citations1989Tomihisa Kamada, Satoru Kawai
The MIT Press eBooksThe Rapid Evaluation of Potential Fields in Particle Systems
1,059 Citations1988Leslie Greengard
Computational GeometryAlgorithms for drawing graphs: an annotated bibliography
860 Citations1994Giuseppe Di Battista, Peter Eades +2 more
A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
Data ProcessingThe C programming language
558 Citations1985Russell Jones
This presentation explains how the C programming language, known as a high-level assembly language, and provides useful tools for programmers, can be modified for use with PCs.
SIAM Journal on Scientific and Statistical ComputingAn Efficient Program for Many-Body Simulation
535 Citations1985Andrew W. Appel
This paper describes both the particular program and the methodology underlying such speedups that reduced the running time of a large problem $(N = 10,000)$ by a factor of four hundred.
ACM Transactions on GraphicsDrawing graphs nicely using simulated annealing
489 Citations1996Ron Davidson, David Harel
The paradigm of simulated annealing is applied to the problem of drawing graphs “nicely,” and the algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result.
Kluwer international series in engineering and computer scienceThe Annealing Algorithm
406 Citations1989Ria Otten, L. P. P. P. van Ginneken
The Annealing Algorithm: A Preview is presented, with a focus on the implementation of the selection function, which addresses the challenge of determining the minimum number of iterations for a discrete-time algorithm.
CERN Document Server (European Organization for Nuclear Research)The AWK Programming Language
406 Citations1988Alfred V. Aho, Brian W. Kernighan +1 more
Communications of the ACMProgramming pearls
333 Citations1987Jon Bentley, David Gries
This book is about programming pearls whose origins lie beyond solid engineering, in the realm of insight and creativity, and a new theme in this edition is how to evaluate and use software components.
IEEE Transactions on Circuits and SystemsA forced directed component placement procedure for printed circuit boards
258 Citations1979N. Quinn, M.A. Breuer
A new mathematical formulation of the concept of force directed placement is presented, and an efficient computational procedure for solving the resulting system of equations is described.
Computer Vision Graphics and Image ProcessingA simple method for computing general position in displaying three-dimensional objects
138 Citations1988Tomihisa Kamada, Satoru Kawai
A simple method for computing the general position based on the line data is presented and the algorithms of computing the most general eye position by solving this maximin problem are presented.
Standard cell placement using simulated sintering
39 Citations1987Lov K. Grover
This paper proposes a simulated sintering technique which is analogous to the sintered process in material processing, and shows that by starting out with a good initial configuration instead of a random configuration, and restricting uphill moves, this can considerably speed up simulated annealing.