Circumscribing Polygons and Polygonizations for Disjoint Line Segments

Hugo A. Akitaya, Matias Korman, Oliver Korten +3

Given a planar straight-line graph $G=(V,E)$ in ${\mathbb{R}}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is eit…