Showing 2019Show all
2 papers · 1 filter
cs.DS2019
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…
cs.DS2019
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…