Finding the Maximal Empty Rectangle Containing a Query Point

Details Finding the Maximal Empty Rectangle Containing a Query Point Finding the Maximal Empty Rectangle Containing a Query Point

2011-06-18

arxiv.org/abs/1106.3628v1

Computer Science

Computational Geometry

Scientific paper

Let $P$ be a set of $n$ points in an axis-parallel rectangle $B$ in the plane. We present an $O(n\alpha(n)\log^4 n)$-time algorithm to preprocess $P$ into a data structure of size $O(n\alpha(n)\log^3 n)$, such that, given a query point $q$, we can find, in $O(\log^4 n)$ time, the largest-area axis-parallel rectangle that is contained in $B$, contains $q$, and its interior contains no point of $P$. This is a significant improvement over the previous solution of Augustine {\em et al.} \cite{qmex}, which uses slightly superquadratic preprocessing and storage.

Affiliated with

Also associated with

No associations

Rating

Finding the Maximal Empty Rectangle Containing a Query Point does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding the Maximal Empty Rectangle Containing a Query Point, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding the Maximal Empty Rectangle Containing a Query Point will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465468