Experimental analysis of the accessibility of drawings with few segments
Abstract
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 furthestpair or shortestpath task on the drawings.
 Publication:

arXiv eprints
 Pub Date:
 August 2017
 arXiv:
 arXiv:1708.09815
 Bibcode:
 2017arXiv170809815K
 Keywords:

 Computer Science  Computational Geometry
 EPrint:
 Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)