4 papers · 1 filter
An SPQR-Tree-Like Embedding Representation for Level Planarity
Guido Brückner, Ignaz Rutter
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a biconnected planar graph. It is a key tool in a number of constrained planarity testing algo…
An SPQR-Tree-Like Embedding Representation for Upward Planarity
Guido Brückner, Markus Himmel, Ignaz Rutter
The SPQR-tree is a data structure that compactly represents all planar embeddings of a biconnected planar graph. It plays a key role in constrained planarity testing. We develop a…
Level-Planar Drawings with Few Slopes
Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze
We introduce and study level-planar straight-line drawings with a fixed number of slopes. For proper level graphs, we give an -time algorithm that…
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…