Experimental Analysis of the Accessibility of Drawings with Few Segments
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 study the question if drawings with few segments have a better aesthetic appeal and help the user to asses the underlying graph. We design an experiment 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 users to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.
The authors would like to thank all anonymous volunteers who participated in the presented user study.
- 4.Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129–1164 (1991)Google Scholar
- 5.Hatzinger, R., Dirrich, R.: prefmod: an R package for modeling preferences based on paired comparisons, rankings, or ratings. J. Statist. Softw. 48(10), 1–31 (2011)Google Scholar
- 7.Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. Arxiv report arXiv: 1708.09815 (2017)
- 11.Rusu, A., Yao, C., Crowell, A.: A planar straight-line grid drawing algorithm for high degree general trees with user-specified angular coefficient. In: Proceedings of 12th International Conference Information Visualization (IV 2008), pp. 600–609. IEEE Computer Society (2008)Google Scholar
- 14.Walker II, J.Q.: A node-positioning algorithm for general trees. Softw. Pract. Exper. 20(7), 685–705 (1990)Google Scholar