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

Authors

231

  1. YK
    Yehuda Koren

    AT&T (United States), United States

    7 publications · 508 citations

    7

    h-index

  2. TD
    Tim Dwyer

    Monash University, Australia

    6 publications · 316 citations

    6

    h-index

  3. FM
    Fan Mo

    China Centre for Resources Satellite Data and Application, China

    3 publications · 105 citations

    3

    h-index

  4. AT
    Ayellet Tal

    Technion – Israel Institute of Technology, Israel

    3 publications · 265 citations

    3

    h-index

  5. AK
    Andrew Kennings

    University of Waterloo, Canada

    3 publications · 112 citations

    3

    h-index

1–5 of 231

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 11 publications · 549 citations

    11

    h-index

  2. Journal of Graph Algorithms and Applications

    JGAA · 5 publications · 368 citations

    5

    h-index

  3. Computer Graphics Forum

    3 publications · 89 citations

    3

    h-index

  4. IEEE Symposium on Information Visualization

    Conference · 3 publications · 325 citations

    3

    h-index

  5. 2

    h-index

1–5