By Topic

Planar Point Location in Sublogarithmic Time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Patrascu, M. ; MIT, USA

We consider the static planar point location problem in an arbitrary polygonal subdivision given by n segments. We assume points come from the [u]2 grid, and consider algorithms for the RAM with words of O(lg u) bits. We give the first solution to the problem which can surpass the traditional query time of O(lgn). Specifically, we can obtain a query time of O(radic(lg u)). Though computational geometry on a grid has been investigated for a long time (including for this problem), it is generally not known how to make good use of a bounded universe in problems of such nonorthogonal flavor. Our result shows this limitation can be surpassed, at least for planar point location. A result by Timothy Chan, appearing independently in FOCS'06, also achieves sublogarithmic query times. Combining the two results, we obtain the following bound. For any S ges 2, the exists a data structure using space O(n middot S) which supports queries in time: O(min {((lg n)/(lg lg n)), (radic((lg u)/(lg lg u))), ((lg u)/(lg S))})

Published in:

Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on

Date of Conference:

Oct. 2006