Force-directed Layouts
Force-Directed Layouts is a class of automatic graph drawing algorithms that compute positions for the nodes of a graph in two- or three-dimensional space by modeling them within a system of mechanical forces or energies (typically with repulsive forces between nodes and attractive forces along edges) and iteratively seeking an equilibrium configuration that yields an aesthetically pleasing layout with approximately uniform edge lengths and few edge crossings using only the graph’s structural information.
99
Publications
14.9K
Citations
231
Authors
115
Institutions
Publications per year
2017–2026
18
Variants
Force-directed Graph DrawingForce-directed LayoutForce-directed Placement
99
Efficient, High-Quality Force-Directed Graph Drawing
The Mathematica Journal · 2006 · 472 citations
Generic global placement and floorplanning
Hans Eisenmann, Frank Johannes · 1998 · 396 citations
1–5 of 99
231
7
h-index
6
h-index
China Centre for Resources Satellite Data and Application, China
3 publications · 105 citations
3
h-index
3
h-index
3
h-index
1–5 of 231
115

Monash University
Melbourne, Australia
6 h-index
9 publications
505 citations
AT&T (United States)
Bedminster, United States
5 h-index
5 publications
208 citations
University of California, Berkeley
Berkeley, United States
4 h-index
12 publications
366 citations
University of Arizona
Tucson, United States
4 h-index
4 publications
202 citations

The University of Sydney
Sydney, Australia
3 h-index
8 publications
182 citations

Data61
Sydney, Australia
3 h-index
8 publications
194 citations
Institut d'Etudes Politiques de Paris
Paris, France
3 h-index
5 publications
6K citations
University of California, Irvine
Irvine, United States
3 h-index
8 publications
187 citations
1–8 of 115
TVCG · 11 publications · 549 citations
11
h-index
JGAA · 5 publications · 368 citations
5
h-index
3 publications · 89 citations
3
h-index
Conference · 3 publications · 325 citations
3
h-index
Repository · 2 publications · 25 citations
2
h-index
1–5