Experimental Analysis of the Accessibility of Drawings with Few Segments

@article{Kindermann2017ExperimentalAO,
  title={Experimental Analysis of the Accessibility of Drawings with Few Segments},
  author={Philipp Kindermann and Wouter Meulemans and Andr{\'e} Schulz},
  journal={ArXiv},
  year={2017},
  volume={abs/1708.09815}
}
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… 

Figures from this paper

Drawing planar graphs with few segments on a polynomial grid

The visual complexity of a graph drawing can be measured by the number of geometric objects used for the representation of its elements. In this paper, we study planar graph drawings where edges are

The Complexity of Drawing Graphs on Few Lines and Few Planes

TLDR
This work investigates the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes, and shows lower and upper bounds for the numbers of lines and planes needed for covering drawings of graphs in certain graph classes.

Drawing Planar Graphs with Few Geometric Primitives

TLDR
The problem of drawing maximal planar graphs with circular arcs is studied and an algorithm to draw such graphs using only \((5n\,11)/3\) arcs is provided, providing a significant improvement over the lower bound of 2n for line segments for a nontrivial graph class.

Drawing Graphs on Few Circles and Few Spheres

TLDR
It turns out that spherical covers are sometimes significantly smaller than affine covers, and this paper introduces the spherical cover number, which is the minimum number of circles that together cover a crossing-free circular-arc drawing in 2D (or 3D).

Upward Planar Drawings with Three and More Slopes

TLDR
It is shown that in general NP-hard to decide whether a given directed graph with maximum in and outdegree at most k admits such a drawing with k slopes, and for cactus graphs deciding and constructing a drawing can be done in polynomial time.

The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs

TLDR
The first linear universal lower bounds for outerpaths, maximal outerplanar graphs, 2-trees, and planar 3-Trees are proved, which shows that the existing algorithms for these graph classes are constant-factor approximations.

Level-Planar Drawings with Few Slopes

TLDR
It is shown that testing whether non-proper level graphs admit level-planar drawings with λ slopes is NP -hard even in restricted cases.

Line and Plane Cover Numbers Revisited

TLDR
It is NP-hard to decide, for a given planar graph~$G, whether $\pi^1_2(G)=2$ and it is shown that the universal stacked triangulation of depth~$d$, $G_d, has $\pi+1(G-d)=d+1$.

Upward Planar Drawings with Three Slopes

TLDR
It is shown that deciding whether a digraph admits such a drawing is NP-hard already for embedded outerplanar digraphs, though linear-time solvable for trees with and without given embedding.

References

SHOWING 1-10 OF 18 REFERENCES

Drawing trees and triangulations with few geometric primitives

TLDR
The problem of drawing maximal planar graphs with circular arcs is studied and an algorithm to draw such graphs using only (5n− 11)/3 arcs is provided, which provides a significant improvement over the lower bound of 2n for line segments for a nontrivial graph class.

Drawing Planar Graphs with Few Geometric Primitives

TLDR
The problem of drawing maximal planar graphs with circular arcs is studied and an algorithm to draw such graphs using only \((5n\,11)/3\) arcs is provided, providing a significant improvement over the lower bound of 2n for line segments for a nontrivial graph class.

Drawing Graphs with Few Arcs

  • A. Schulz
  • Mathematics
    J. Graph Algorithms Appl.
  • 2015
TLDR
Algorithms for constructing composite arc-drawings for trees, series-parallel graphs, planar 3-trees and general planar graphs are presented and a lower bound for the maximal size of the arrangement’s ground set is provided.

Drawings of planar graphs with few slopes and segments

A Planar Straight-line Grid Drawing Algorithm for High Degree General Trees with User-Specified Angular Coefficient

TLDR
This paper allows the user to provide an angular coefficient and then employs the 'best-effort-delivery' to draw edges such that the angles are above the angular coefficient, which allows the non-root nodes to place their children within a maximum of three quads of the Cartesian plane.

Tidier Drawings of Trees

TLDR
It is shown that various algorithms for producing tidy drawings of trees contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings, and a new algorithm is presented with comparable time and storage requirements that produces tidier drawings.

On the angular resolution of planar graphs

TLDR
A very natural linear program is analyzed that bounds the angular resolution of any fixed planar graph G from &OHgr;(1/<italic>d</italic>, although currently, it is unable to settle whether or not this lower bound is existentially tight (up to constant α).

Graph drawing by force‐directed placement

TLDR
A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.

D 3 : Data-Driven Documents

TLDR
This work shows how representational transparency improves expressiveness and better integrates with developer tools than prior approaches, while offering comparable notational efficiency and retaining powerful declarative components.