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 investigate whether drawings with few segme...

Full description

Saved in:
Bibliographic Details
Published in:Journal of graph algorithms and applications 2018-09, Vol.22 (3), p.501-518
Main Authors: Kindermann, Philipp, Meulemans, Wouter, Schulz, André
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1526-1719
1526-1719
DOI:10.7155/jgaa.00474