Showing cs.DSShow all
3 papers · 1 filter
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 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 in linear time into a planar graph with a minimal number of crossings on , is a helpful tool for designing heuristics…
cs.DS2017
Aligned Drawings of Planar Graphs
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter
Let be a graph that is topologically embedded in the plane and let be an arrangement of pseudolines intersecting the drawing of . An aligned drawing of and…