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.
%0 Journal Article
%1 Fruchterman1991Graph
%A Fruchterman, Thomas M. J.
%A Reingold, Edward M.
%C New York, NY, USA
%D 1991
%I John Wiley & Sons, Ltd.
%J Softw: Pract. Exper.
%K network\_visualization, networks algorithms
%N 11
%P 1129--1164
%R 10.1002/spe.4380211102
%T Graph drawing by force-directed placement
%U http://dx.doi.org/10.1002/spe.4380211102
%V 21
%X 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.
@article{Fruchterman1991Graph,
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.}},
added-at = {2019-06-10T14:53:09.000+0200},
address = {New York, NY, USA},
author = {Fruchterman, Thomas M. J. and Reingold, Edward M.},
biburl = {https://www.bibsonomy.org/bibtex/2d96db253162a2d69b2eb120b1dcbbc01/nonancourt},
citeulike-article-id = {1196622},
citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=137557},
citeulike-linkout-1 = {http://dx.doi.org/10.1002/spe.4380211102},
citeulike-linkout-2 = {http://www3.interscience.wiley.com/cgi-bin/abstract/113446534/ABSTRACT},
day = 1,
doi = {10.1002/spe.4380211102},
interhash = {db182bf8293d0e86786610b45e85d895},
intrahash = {d96db253162a2d69b2eb120b1dcbbc01},
issn = {0038-0644},
journal = {Softw: Pract. Exper.},
keywords = {network\_visualization, networks algorithms},
month = nov,
number = 11,
pages = {1129--1164},
posted-at = {2008-12-18 17:44:27},
priority = {2},
publisher = {John Wiley \& Sons, Ltd.},
timestamp = {2019-07-31T12:32:46.000+0200},
title = {{Graph drawing by force-directed placement}},
url = {http://dx.doi.org/10.1002/spe.4380211102},
volume = 21,
year = 1991
}