
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
We show how to test in linear time whether an outerplanar graph admits a...
read it

Extending Partial Orthogonal Drawings
We study the planar orthogonal drawing style within the framework of par...
read it

Multilevel Planarity
In this paper, we introduce and study the multilevelplanarity testing p...
read it

Drawing TreeBased Phylogenetic Networks with Minimum Number of Crossings
In phylogenetics, treebased networks are used to model and visualize th...
read it

Extending Upward Planar Graph Drawings
In this paper we study the computational complexity of the Upward Planar...
read it

Upward planar drawings with two slopes
In an upward planar 2slope drawing of a digraph, edges are drawn as str...
read it

Graph Stories in Small Area
We study the problem of drawing a dynamic graph, where each vertex appea...
read it
Drawing Two Posets
We investigate the problem of drawing two posets of the same ground set so that one is drawn from left to right and the other one is drawn from the bottom up. The input to this problem is a directed graph G = (V, E) and two sets X, Y with X ∪ Y = E, each of which can be interpreted as a partial order of V. The task is to find a planar drawing of G such that each directed edge in X is drawn as an xmonotone edge, and each directed edge in Y is drawn as a ymonotone edge. Such a drawing is called an xyplanar drawing. Testing whether a graph admits an xyplanar drawing is NPcomplete in general. We consider the case that the planar embedding of G is fixed and the subgraph of G induced by the edges in Y is a connected spanning subgraph of G whose upward embedding is fixed. For this case we present a lineartime algorithm that determines whether G admits an xyplanar drawing and, if so, produces an xyplanar polyline drawing with at most three bends per edge.
READ FULL TEXT
Comments
There are no comments yet.