On Romeo and Juliet Problems: Minimizing Distance-to-Sight

Hee-Kap Ahn, Eunjin Oh, Lena Schlipf +2

We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points $s$ and $t$ in a simple polygon $P$ w…