By Topic

Nearest-Neighbor Queries with Well-Spaced Points

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
$33 $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)
Chris Gray ; Inst. of Oper. Syst. & Comput. Networks, Tech. Univ. Braunschweig, Braunschweig, Germany

We assume we are given a set of points that have the property that their Voronoi diagram-restricted to some suitable bounding box-consists of only fat cells. We call such points well-spaced points. We give a linear-sized data structure for finding the nearest neighbor to a query point among well-spaced points in O(log n) time. We further show how to extend the results to higher dimensions. Finally, we show how to find the Voronoi diagram of these points in O(n log n) time in 3 dimensions.

Published in:

Voronoi Diagrams in Science and Engineering (ISVD), 2010 International Symposium on

Date of Conference:

28-30 June 2010