A fast algorithm for computing a planar support for non-piercing rectangles

Ambar Pal, Rajiv Raman, Saurabh Ray +1

For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in \mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is co…