By Topic

Adaptive Point Location with almost No Preprocessing in Delaunay Triangulations

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)

This paper studies adaptive point location in Delaunaytriangulations with $o(n^{1/3})$ (and practically $O(1)$) preprocessing and storage. Given $n$ pseudo-random points in a compact convex set $C$ with unit area in two dimensions (2D) and the corresponding Delaunay triangulation, assume that we know the query points are clustered into $k$ compact convex sets $C_isubset C$, each with diameter$D(C_i)$, then we show that an adaptive version of the Jump\& Walk method(which requires $o(n^{1/3})$ preprocessing) achieves average query bound$O(n^{frac{1-4delta}{3}})$ when in the preprocessing$Theta(n^{frac{1-4delta}{3}})$ sample points are chosen within each $C_i$, where $D(C_i)=Theta(frac{1}{n^delta})$ and $0leqdeltaleq 1/4$.Similar result holds in three dimensions (3D). Empirical results in 2Dshow that this procedure is 23%-350% more efficient than its predecessors under various clustered cases.

Published in:

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

Date of Conference:

27-29 June 2012