论文信息 - Graph drawing by force‐directed placement

Graph drawing by force‐directed placement

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.

Edward M. Reingold | Thomas M. J. Fruchterman | E. Reingold

[1] Tobias J. Hagge,et al. Physics , 1929, Nature.

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .

[4] N. Quinn,et al. A forced directed component placement procedure for printed circuit boards , 1979 .

[5] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[6] Peter Eades,et al. A Heuristic for Graph Drawing , 1984 .

[7] Andrew W. Appel,et al. An Efficient Program for Many-Body Simulation , 1983 .

[8] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..

[9] Lov K. Grover. Standard Cell Placement Using Simulated Sintering , 1987, 24th ACM/IEEE Design Automation Conference.

[10] Jon Louis Bentley,et al. Programming pearls , 1987, CACM.

[11] L. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[12] Satoru Kawai,et al. A simple method for computing general position in displaying three-dimensional objects , 1988, Comput. Vis. Graph. Image Process..

[13] Alfred V. Aho,et al. The awk programming language , 1988 .

[14] R. H. J. M. Otten,et al. The Annealing Algorithm , 1989 .

[15] Satoru Kawai,et al. An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[16] John E. Howland,et al. Computer graphics , 1990, IEEE Potentials.

[17] Stephen C. Dewhurst,et al. Programming in C++ , 1989, OOPS Messenger.