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
15
A multilevel analytical placement for 3D ICs
Jason Cong, Guojie Luo · 2009 · 56 citations
A new algorithm for removing node overlapping in graph visualization
Xiaodi Huang, Wei Lai, A. S. M. Sajeev et al. · Information Sciences · 2007 · 54 citations · Full text
Using spring algorithms to remove node overlapping
Wanchun Li, Peter Eades, Nikola S. Nikolov · 2005 · 50 citations
A multilevel analytical placement for 3D ICs
Jason Cong, Guojie Luo · 2009 · 48 citations
1–5 of 15
39
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 39
25
AT&T (United States)
Bedminster, United States
2 h-index
3 publications
74 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
4 publications
46 citations

The University of Sydney
Sydney, Australia
2 h-index
5 publications
188 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
4 publications
208 citations
Swinburne University of Technology
Melbourne, Australia
2 h-index
3 publications
104 citations
Intel (United States)
Santa Clara, United States
1 h-index
1 publications
31 citations

California NanoSystems Institute
Los Angeles, United States
1 h-index
1 publications
48 citations

Charles Sturt University
Bathurst, Australia
1 h-index
1 publications
54 citations
1–8 of 25
2 publications · 67 citations
2
h-index
JGAA · 2 publications · 44 citations
2
h-index
1 publications · 10 citations
1
h-index
1 publications · 54 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1–5