Efficient Range Reporting of Convex Hull

We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the minimum convex polygon formed by $S$. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in $P$ that also fall with in an orthogonal range$[x{lt},x{rt}]\times{}[yb, yt]$. We propose a $O(n \log^{2} n) $ space data structure that can support reporting points on a convex hull inside an orthogonal range query, in time $O(\log^{3} n + h)$. Here $h$ is the size of the output. This work improves the result of (Brass et al. 2013) \cite{brass} that builds a data structure that uses $O(n \log^{2} n)$ space and has a $O(\log^{5} n + h)$ query time. Additionally, we show that our data structure can be modified slightly to solve other related problems. For instance, for counting the number of points on the convex hull in an orthogonal query rectangle, we propose an $O(n \log^{2}n)$ space data structure that can be queried upon in $O(\log^{3} n)$ time. We also propose a $O(n \log^{2} n) $ space data structure that can compute the $area$ and $perimeter$ of the convex hull inside an orthogonal range query in $O(\log^{3} n$) time.