Experimental Analysis of the Accessibility of Drawings with Few Segments

DOI10.1007/978-3-319-73915-1_5zbMath1503.68224arXiv1708.09815OpenAlexW2751157569MaRDI QIDQ4625100

André Schulz, Philipp Kindermann, Wouter Meulemans

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)

Related Items (1)

Drawing Planar Graphs with Few Geometric Primitives

Cites Work

• Unnamed Item
• Time series forecasting using a hybrid ARIMA and neural network model
• Drawing planar graphs with few geometric primitives
• Drawings of planar graphs with few slopes and segments
• An experimental comparison of four graph drawing algorithms.
• On the Angular Resolution of Planar Graphs
• Experimental Analysis of the Accessibility of Drawings with Few Segments
• Sampling Theory
• Robust Regression and Lasso

This page was built for publication: Experimental Analysis of the Accessibility of Drawings with Few Segments