Geodesic
Efficient, Proximity-Preserving Node Overlap Removal
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Sixteenth International Symposium on Graph Drawing, GD 2008 , Tome 14 (2010) no. 1, pp. 53-74.

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

When drawing graphs whose nodes contain text or graphics, the non-trivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm that does well at retaining a graph's shape while using little additional area and time. As part of the analysis, we consider and evaluate two measures of dissimilarity for two layouts of the same graph.
DOI : 10.7155/jgaa.00198
Keywords: graph drawing, overlap removal, proximity graph, Procrustes analysis, stress majorization 
@article{JGAA_2010_14_1_a3,
     author = {Emden Gansner and Yifan Hu},
     title = {Efficient, {Proximity-Preserving} {Node} {Overlap} {Removal}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {53--74},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2010},
     doi = {10.7155/jgaa.00198},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00198/}
}
TY  - JOUR
AU  - Emden Gansner
AU  - Yifan Hu
TI  - Efficient, Proximity-Preserving Node Overlap Removal
JO  - Journal of Graph Algorithms and Applications
PY  - 2010
SP  - 53
EP  - 74
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00198/
DO  - 10.7155/jgaa.00198
LA  - en
ID  - JGAA_2010_14_1_a3
ER  - 
%0 Journal Article
%A Emden Gansner
%A Yifan Hu
%T Efficient, Proximity-Preserving Node Overlap Removal
%J Journal of Graph Algorithms and Applications
%D 2010
%P 53-74
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00198/
%R 10.7155/jgaa.00198
%G en
%F JGAA_2010_14_1_a3
Emden Gansner; Yifan Hu. Efficient, Proximity-Preserving Node Overlap Removal. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Sixteenth International Symposium on Graph Drawing, GD 2008
					, Tome 14 (2010) no. 1, pp. 53-74. doi : 10.7155/jgaa.00198. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00198/

Cité par Sources :