Geodesic
Node Overlap Removal by Growing a Tree
Journal of Graph Algorithms and Applications, Special issue on Selected papers from the Twenty-fourth International Symposium on Graph Drawing and Network Visualization, GD 2016 , Tome 21 (2017) no. 5, pp. 857-872.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by "growing" the tree. The algorithm is simple to implement, yet it produces high quality layouts. According to our experiments it runs several times faster than the current state-of-the-art methods. 
@article{JGAA_2017_21_5_a3,
     author = {Lev Nachmanson and Arlind Nocaj and Sergey Bereg and Leishi Zhang and Alexander Holroyd},
     title = {Node {Overlap} {Removal} by {Growing} a {Tree}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {857--872},
     publisher = {mathdoc},
     volume = {21},
     number = {5},
     year = {2017},
     doi = {10.7155/jgaa.00442},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00442/}
}
TY  - JOUR
AU  - Lev Nachmanson
AU  - Arlind Nocaj
AU  - Sergey Bereg
AU  - Leishi Zhang
AU  - Alexander Holroyd
TI  - Node Overlap Removal by Growing a Tree
JO  - Journal of Graph Algorithms and Applications
PY  - 2017
SP  - 857
EP  - 872
VL  - 21
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00442/
DO  - 10.7155/jgaa.00442
LA  - en
ID  - JGAA_2017_21_5_a3
ER  - 
%0 Journal Article
%A Lev Nachmanson
%A Arlind Nocaj
%A Sergey Bereg
%A Leishi Zhang
%A Alexander Holroyd
%T Node Overlap Removal by Growing a Tree
%J Journal of Graph Algorithms and Applications
%D 2017
%P 857-872
%V 21
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00442/
%R 10.7155/jgaa.00442
%G en
%F JGAA_2017_21_5_a3
Lev Nachmanson; Arlind Nocaj; Sergey Bereg; Leishi Zhang; Alexander Holroyd. Node Overlap Removal by Growing a Tree. Journal of Graph Algorithms and Applications, 
							Special issue on Selected papers from the Twenty-fourth International Symposium on Graph Drawing and Network Visualization, GD 2016
					, Tome 21 (2017) no. 5, pp. 857-872. doi : 10.7155/jgaa.00442. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00442/

Cité par Sources :