Thomas Bläsius

most citedPixel and Voxel Representations of Graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

4 papers

cs.DS2015

Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices

Thomas Bläsius, Annette Karrer, Ignaz Rutter

A simultaneous embedding (with fixed edges) of two graphs $G^{1}$ and $G^{2}$ with common graph $G = G^{1} \cap G^{2}$ is a pair of planar drawings of $G^{1}$ and $G^{2}$ that coincide on $G$ . I…

cs.DS2015

A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem

Thomas Bläsius, Ignaz Rutter

The clustered planarity problem (c-planarity) asks whether a hierarchically clustered graph admits a planar drawing such that the clusters can be nicely represented by regions. We…

cs.DM2015★ 1 cited

Pixel and Voxel Representations of Graphs

Muhammad Jawaherul Alam, Thomas Bläsius, Ignaz Rutter +2

We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose…

cs.DS2013

Testing Mutual Duality of Planar Graphs

Patrizio Angelini, Thomas Bläsius, Ignaz Rutter

We introduce and study the problem \mpd, which asks for two planar graphs $G_{1}$ and $G_{2}$ whether $G_{1}$ can be embedded such that its dual is isomorphic to $G_{2}$ . Our algorithmic m…