Graph drawing by force‐directed placement
- 1 November 1991
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 21 (11) , 1129-1164
- https://doi.org/10.1002/spe.4380211102
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
This publication has 9 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- The Annealing AlgorithmPublished by Springer Nature ,1989
- The Rapid Evaluation of Potential Fields in Particle SystemsPublished by MIT Press ,1988
- A simple method for computing general position in displaying three-dimensional objectsComputer Vision, Graphics, and Image Processing, 1988
- Standard cell placement using simulated sinteringPublished by Association for Computing Machinery (ACM) ,1987
- An Efficient Program for Many-Body SimulationSIAM Journal on Scientific and Statistical Computing, 1985
- Optimization by Simulated AnnealingScience, 1983
- A forced directed component placement procedure for printed circuit boardsIEEE Transactions on Circuits and Systems, 1979
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969