Advertisement

Algorithmica

, Volume 22, Issue 4, pp 477–482 | Cite as

A Note on Point Location in Delaunay Triangulations of Random Points

  • L. Devroye
  • E. P. Mücke
  •  Binhai Zhu

Abstract.

This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data structure representing the triangulation. A simple and easy-to-implement (but, of course, worst-case suboptimal) heuristic is shown to take expected time O(n 1/3 ) .

Key words. Voronoi diagram, Delaunay triangulation, Point location, Probabilistic analysis of algorithms, Computational geometry. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • L. Devroye
    • 1
  • E. P. Mücke
    • 2
  •  Binhai Zhu
    • 3
  1. 1.School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7.CA
  2. 2.ANSYS, Inc., 201 Johnson Road, Houston, PA 15342-1300, USA.US
  3. 3.Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong.HK

Personalised recommendations