3 papers
cs.CG2024
Clustered Planarity Variants for Level Graphs
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants tha…
cs.DS2023
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm
Simon D. Fink, Ignaz Rutter
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived fro…
cs.DS2023
Maintaining Triconnected Components under Node Expansion
Simon D. Fink, Ignaz Rutter
SPQR-trees are a central component of graph drawing and are also important in many further areas of computer science. From their inception onwards, they have always had a strong re…