A Note on Point Location in Delaunay Triangulations of Random Points

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(n1/3). Key Words. Voronoi diagram, Delaunay triangulation, Point location, Probabilistic analysis of algorithms, Computational geometry.

• Type: Journal
• Year: 1998
• Where: ALGORITHMICA
• Authors: Luc Devroye, Ernst P. Mücke, Binhai Zhu
• Keywords: ALGORITHMICA 1998, Delaunay Triangulation, Point Location, Short Note