A Note on Point Location in Delaunay Triangulations of Random Points
- 153 Downloads
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 ) .
Unable to display preview. Download preview PDF.