Node Overlap Removal

Node Overlap Removal is a computational technique in force-directed layout algorithms for node-link diagrams that systematically adjusts node positions to eliminate overlapping regions between nodes while preserving the overall structural arrangement of the graph.

15

Publications

455

Citations

39

Authors

25

Institutions

Publications per year

2017–2026

3

Variants

Node Overlap Resolution

Authors

39

  1. WL
    Wei Lai

    Swinburne University of Technology, Australia

    2 publications · 79 citations

    2

    h-index

  2. GL
    Guojie Luo

    Peking University, China

    2 publications · 104 citations

    2

    h-index

  3. XH
    Xiaodi Huang

    Charles Sturt University, Australia

    2 publications · 79 citations

    2

    h-index

  4. YH
    Yifan Hu

    AT&T (United States), United States

    2 publications · 42 citations

    2

    h-index

  5. JC
    Jason Cong

    University of California, Los Angeles, United States

    2 publications · 104 citations

    2

    h-index

1–5 of 39

Venues

  1. 2

    h-index

  2. Journal of Graph Algorithms and Applications

    JGAA · 2 publications · 44 citations

    2

    h-index

  3. Landscape and Urban Planning

    1 publications · 10 citations

    1

    h-index

  4. Information Sciences

    1 publications · 54 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 10 citations

    1

    h-index

1–5