21 citations · 120 across the 54 of their papers we have counts for
31 papers · 1 filter
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…
Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg +2
We consider the problem of untangling a given (non-planar) straight-line circular drawing of an outerplanar graph into a planar straight-line circular drawing by s…
Morphing Rectangular Duals
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter +2
A rectangular dual of a plane graph is a contact representations of by interior-disjoint axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the…
Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)
Helen Purchase, Ignaz Rutter
This is the arXiv index for the electronic proceedings of GD 2021, which contains the peer-reviewed and revised accepted papers with an optional appendix. Proceedings (without appe…
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing
Lukas Barth, Benjamin Niedermann, Ignaz Rutter +1
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edge…
Polygon-Universal Graphs
Tim Ophelders, Ignaz Rutter, Bettina Speckmann +1
We study a fundamental question from graph drawing: given a pair of a graph and a cycle in together with a simple polygon , is there a straight-line drawing…