Luc Devroye Christophe Lemaire Jean-Michel Moreau  Home/Search
Context
Related
| cs.ubc.ca/conferences/CCCG/...c24.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ubc.ca/conferences/...elecproc (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an improvement over a former technique, Jump & Walk ([7]), to locate points in the Delaunay triangulation of n sites uniformly distributed in a square. The method uses a dynamically balanced search tree. It is also studied when applied to a static balanced 2-d tree. This paper gives expected time analyses when the query points are bounded away from the boundary of the triangulation: the proof for the unrestricted case is much more complex, and will be presented in another paper (in... (Update)
Similar documents (at the sentence level):
5.5%: Expected Time Analysis for Delaunay Point Location - Devroye, Lemaire, Moreau (2004) (Correct)
Active bibliography (related documents): More All
0.0: Partially Persistent Search Trees with Transcript Operations - Larsen (1999) (Correct)
0.0: Biased Finger Trees and Three-Dimensional Layers of Maxima - Atallah, Goodrich, al. (1994) (Correct)
0.0: A New Weight Balanced Binary Search Tree - Cho, Sahnit (Correct)
Similar documents based on text: More All
0.0: Analysis of a class of k-dimensional merge procedures, with.. - Lemaire, Moreau (1997) (Correct)
0.0: ELAN: User Manual - Borovansky, Cirstea, Dubois.. (2000) (Correct)
0.0: Shape Preserving Local Histogram Modification - Caselles, Lisani, Morel, Sapiro (1999) (Correct)
BibTeX entry: (Update)
@inproceedings{ devroyefast,
author = "L. Devroye and C. Lemaire and J. M. Moreau",
title = "Fast {Delaunay} point location with search structures",
pages = "136--141",
url = "citeseer.ist.psu.edu/371305.html" }
Citations (may not include all citations):17 the average number of rebalancing operations in weight-balan.. (context) - Blum, Mehlhorn - 1980
1 Intersections with random geometric objets (context) - Bose, Devroye - 1998
Documents on the same site (http://www.cs.ubc.ca/conferences/CCCG/elec_proc/elecproc.html): More
Convex Group Clustering of Large Geo-referenced Data Sets - Estivill-Castro (1999) (Correct)
Near-Optimal Partitioning of Rectangles and Prisms - Bose, Czyzowicz, Kranakis.. (1999) (Correct)
When Can a Net Fold to a Polyhedron? - Biedl, Lubiw, Sun (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC