Polygon Queries for Convex Hulls of Points

Abstract: We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon $Q$, the convex hull of $P\cap Q$ can be computed efficiently, where an $\mathcal{O}$-oriented polygon is a polygon whose edges have orientations in $\mathcal{O}$. We present a data structure with $O(nk<sup>3\log<sup>2n)$ space and $O(nk<sup>3\log<sup>2n)$ construction time, and an $O(h+s\log² n)$-time query algorithm for any query $\mathcal{O}$-oriented convex $s$-gon $Q$, where $h$ is the complexity of the convex hull. Also, we can compute the perimeter or area of the convex hull of $P\cap Q$ in $O(s\log<sup>2n)$ time using the data structure.