Experimental analysis of the accessibility of drawings with few segments

DOI10.1007/978-3-319-73915-1_5MaRDI QIDQ4625100zbMATH OpenOpenAlexFDO

Authors Philipp Kindermann, Wouter Meulemans, André Schulz

Publication date 20 February 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.09815

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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.

Recommendations

• Experimental analysis of the accessibility of drawings with few segments
• Empirical evaluation of aesthetics-based graph layout
• Exploring Complex Drawings via Edge Stratification
• scientific article; zbMATH DE number 1594517
• scientific article; zbMATH DE number 1858605

Cites work

• An experimental comparison of four graph drawing algorithms.
• Drawing planar graphs with few geometric primitives
• Drawings of planar graphs with few slopes and segments
• Experimental analysis of the accessibility of drawings with few segments
• scientific article; zbMATH DE number 6378127 (Why is no real title available?)
• On the Angular Resolution of Planar Graphs
• Robust Regression and Lasso
• Sampling theory. Beyond bandlimited systems
• Time series forecasting using a hybrid ARIMA and neural network model

Cited in

(3)

• scientific article; zbMATH DE number 2084284 (Why is no real title available?)
• Drawing planar graphs with few geometric primitives
• Experimental analysis of the accessibility of drawings with few segments

This page was built for publication: Experimental analysis of the accessibility of drawings with few segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4625100)