Skip to main content
SpringerLink
Log in

A Note on Point Location in Delaunay Triangulations of Random Points

  • Published:
Algorithmica Aims and scope Submit manuscript

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 ) .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2A7., , , , , , CA

    L. Devroye

  2. ANSYS, Inc., 201 Johnson Road, Houston, PA 15342-1300, USA., , , , , , US

    E. P. Mücke

  3. Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong., , , , , , HK

    Binhai Zhu

Authors
  1. L. Devroye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. P. Mücke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Binhai Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received November 27, 1997; revised February 15, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Devroye, L., Mücke, E. & Binhai Zhu, . A Note on Point Location in Delaunay Triangulations of Random Points . Algorithmica 22, 477–482 (1998). https://doi.org/10.1007/PL00009234

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009234

Search

Navigation