Geodesic
Experimental Analysis of the Accessibility of Drawings with Few Segments
Journal of Graph Algorithms and Applications, Special issue on Selected papers from the Twenty-fifth International Symposium on Graph Drawing and Network Visualization, GD 2017 , Tome 22 (2018) no. 3, pp. 501-518.

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

The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We investigate whether drawings with few segments have a better aesthetic appeal and help the user to assess the underlying graph. We design a user study that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the participants to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.
DOI : 10.7155/jgaa.00474
Keywords: user study, visual complexity, few segments, aesthetics, furthest pair, shortest path 
@article{JGAA_2018_22_3_a5,
     author = {Philipp Kindermann and Wouter Meulemans and Andr\'e Schulz},
     title = {Experimental {Analysis} of the {Accessibility} of {Drawings} with {Few} {Segments}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {501--518},
     publisher = {mathdoc},
     volume = {22},
     number = {3},
     year = {2018},
     doi = {10.7155/jgaa.00474},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00474/}
}
TY  - JOUR
AU  - Philipp Kindermann
AU  - Wouter Meulemans
AU  - André Schulz
TI  - Experimental Analysis of the Accessibility of Drawings with Few Segments
JO  - Journal of Graph Algorithms and Applications
PY  - 2018
SP  - 501
EP  - 518
VL  - 22
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00474/
DO  - 10.7155/jgaa.00474
LA  - en
ID  - JGAA_2018_22_3_a5
ER  - 
%0 Journal Article
%A Philipp Kindermann
%A Wouter Meulemans
%A André Schulz
%T Experimental Analysis of the Accessibility of Drawings with Few Segments
%J Journal of Graph Algorithms and Applications
%D 2018
%P 501-518
%V 22
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00474/
%R 10.7155/jgaa.00474
%G en
%F JGAA_2018_22_3_a5
Philipp Kindermann; Wouter Meulemans; André Schulz. Experimental Analysis of the Accessibility of Drawings with Few Segments. Journal of Graph Algorithms and Applications, 
							Special issue on Selected papers from the Twenty-fifth International Symposium on Graph Drawing and Network Visualization, GD 2017
					, Tome 22 (2018) no. 3, pp. 501-518. doi : 10.7155/jgaa.00474. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00474/

Cité par Sources :