Marcel Radermacher

activity

20182020

collaborators

6 papers

cs.CG2020

Towards a characterization of stretchable aligned graphs

Marcel Radermacher, Ignaz Rutter, Peter Stumpf

We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawi…

cs.CG2019

Geometric Crossing-Minimization -- A Scalable Randomized Approach

Marcel Radermacher, Ignaz Rutter

We consider the minimization of edge-crossings in geometric drawings of graphs $G = (V, E)$ , i.e., in drawings where each edge is depicted as a line segment. The respective decision…

cs.CG2018

Drawing Clustered Graphs on Disk Arrangements

Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter +1

Let $G = (V, E)$ be a planar graph and let $C$ be a partition of $V$ . We refer to the graphs induced by the vertex sets in $C$ as Clusters. Let $D_{C}$ b…

cs.DS2018

Multilevel Planarity

Lukas Barth, Guido Brückner, Paul Jungeblut +1

In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed gr…

cs.DS2018

Inserting an Edge into a Geometric Embedding

Marcel Radermacher, Ignaz Rutter

The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$ , is a helpful tool for designing heuristics…

cs.CG2018

A Greedy Heuristic for Crossing-Angle Maximization

Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze +2

The crossing angle of a straight-line drawing $Γ$ of a graph $G = (V, E)$ is the smallest angle between two crossing edges in $Γ$ . Deciding whether a graph $G$ has a straight-line dr…