A Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose +2

Let $P$ be a simple polygon with $n$ vertices, and let $q\in P$ be a point in $P$. Let $k\in \{0,\dots ,n-1\}$. A point $p\in P$ is $k$-visible from $q$ if and only if the li…