Experimental analysis of the accessibility of drawings with few segments

P. Kindermann, W. Meulemans, A. Schulz

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
73 Downloads (Pure)

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 furthest-pair or shortest-path task on the drawings.
Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization
Subtitle of host publication25th International Symposium, GD 2017, Boston, MA, USA, September 25-27, 2017, Revised Selected Papers
EditorsKwan-Liu Ma, Fabrizio Frati
Place of PublicationDordrecht
PublisherSpringer
Pages52-64
Number of pages13
ISBN (Electronic)978-3-319-73915-1
ISBN (Print)978-3-319-73914-4
DOIs
Publication statusPublished - 2018

Publication series

NameLecture Notes in Computer Science
Volume10692

Fingerprint Dive into the research topics of 'Experimental analysis of the accessibility of drawings with few segments'. Together they form a unique fingerprint.

Cite this