Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

ALGORITHMICA
1998

favoriteEmaildiscussreport

111views more ALGORITHMICA 1998»

A Note on Point Location in Delaunay Triangulations of Random Points

13 years 10 months ago

A Note on Point Location in Delaunay Triangulations of Random Points

Download cg.scs.carleton.ca

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.

Luc Devroye, Ernst P. Mücke, Binhai Zhu

Real-time Traffic

ALGORITHMICA 1998 | Delaunay Triangulation | Point Location | Short Note |

claim paper

Related Content

» Expected time analysis for Delaunay point location

» Splitting a Delaunay Triangulation in Linear Time

» On the Number of Higher Order Delaunay Triangulations

» Preferred directions for resolving the nonuniqueness of Delaunay triangulations

» Kinetic and dynamic Delaunay tetrahedralizations in three dimensions

» The Delaunay Hierarchy

» Facial Feature Location with Delaunay TriangulationVoronoi Diagram Calculation

» A LinearTime Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

» Java Applets for the Dynamic Visualization of Voronoi Diagrams

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	ALGORITHMICA
Authors	Luc Devroye, Ernst P. Mücke, Binhai Zhu

Comments (0)