Drawing Clustered Graphs on Disk Arrangements

Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter +1

Let $G=(V,E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal{C}}$ b…