Geodesic
A Sparse Stress Model
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. 791-821 Cet article a éte moissonné depuis la source Journal of Graph Algorythms and Applications website

Voir la notice de l'article

Force-directed layout methods are among the most common approaches for drawing general graphs. Among them, stress minimization produces layouts of comparatively high quality while also imposing comparatively high computational demands. We propose a speed-up method based on the aggregation of terms in the objective function. It is akin to aggregate repulsion from far-away nodes during spring embedding but transfers the idea from the layout space into a preprocessing phase. An initial experimental study informs a method to select representatives, and subsequent more extensive experiments indicate that our method yields better approximations of minimum-stress layouts in less time than related methods.
DOI : 10.7155/jgaa.00440
Keywords: graph drawing, multidimensional scaling, stress minimization, sparsification 
@article{JGAA_2017_21_5_a1,
     author = {Mark Ortmann and Mirza Klimenta and Ulrik Brandes},
     title = {A {Sparse} {Stress} {Model}},
     journal = {Journal of graph algorithms and applications},
     pages = {791--821},
     year = {2017},
     volume = {21},
     number = {5},
     doi = {10.7155/jgaa.00440},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00440/}
}
TY  - JOUR
AU  - Mark Ortmann
AU  - Mirza Klimenta
AU  - Ulrik Brandes
TI  - A Sparse Stress Model
JO  - Journal of graph algorithms and applications
PY  - 2017
SP  - 791
EP  - 821
VL  - 21
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00440/
DO  - 10.7155/jgaa.00440
LA  - en
ID  - JGAA_2017_21_5_a1
ER  - 
%0 Journal Article
%A Mark Ortmann
%A Mirza Klimenta
%A Ulrik Brandes
%T A Sparse Stress Model
%J Journal of graph algorithms and applications
%D 2017
%P 791-821
%V 21
%N 5
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00440/
%R 10.7155/jgaa.00440
%G en
%F JGAA_2017_21_5_a1
Mark Ortmann; Mirza Klimenta; Ulrik Brandes. A Sparse Stress Model. 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. 791-821. doi: 10.7155/jgaa.00440

Cité par Sources :