Geometric secluded paths and planar satisfiability

Kevin Buchin, Valentin Polishchuk, Leonid Sedov +1

We consider paths with low \emph{exposure} to a 2D polygonal domain, i.e., paths which are seen as little as possible; we differentiate between \emph{integral} exposure (when we ca…