
Aligned Drawings of Planar Graphs
Let G be a graph topological embedded in the plane and let A be an arra...
read it

Drawing HVRestricted Planar Graphs
A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...
read it

On the Edgelength Ratio of Outerplanar Graphs
We show that any outerplanar graph admits a planar straightline drawing ...
read it

Drawing Clustered Graphs on Disk Arrangements
Let G=(V, E) be a planar graph and let C be a partition of V. We refer t...
read it

The Weighted Barycenter Drawing Recognition Problem
We consider the question of whether a given graph drawing Γ of a triconn...
read it

Infinite AllLayers Simple Foldability
We study the problem of deciding whether a crease pattern can be folded ...
read it

String Art: Circle Drawing Using Straight Lines
An algorithm to generate the locus of a circle using the intersection po...
read it
Towards a characterization of stretchable aligned graphs
We consider the problem of stretching pseudolines in a planar straightline drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawing. We answer open questions by Mchedlidze et al. by showing that not all instances with two pseudolines are stretchable. On the positive side, for k≥ 2 pseudolines intersecting in a single point, we prove that in case that some edgepseudoline intersectionpatterns are forbidden, all instances are stretchable. For intersectionfree pseudoline arrangements we show that every aligned graph has an aligned drawing. This considerably reduces the gap between stretchable and nonstretchable instances.
READ FULL TEXT
Comments
There are no comments yet.