Skip to main content
SpringerLink
Log in

Splitting a Delaunay Triangulation in Linear Time

  • Published:
Algorithmica Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Computing the Delaunay triangulation of n points requires usually a minimum of Ω(n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.

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. Computer Science Department, Princeton University, 35 Olden Street, Princeton, NJ 08544, USA. chazelle@cs.princeton.edu. http://ftp.cs.princeton.edu/~chazelle/., US

    Chazelle

  2. INRIA, BP93, 06902 Sophia-Antipolis, France. Olivier.Devillers@sophia.inria.fr, Monique.Teillaud@sophia.inria.fr. www-sop.inria.fr/prisme/., FR

    Devillers &  Teillaud

  3. Departamento de Matemàtica Aplicada II, Universidad Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain. hurtado@ma2.upc.es, mora@ma2.upc.es, vera@ma2.upc.es. www-ma2.upc.es/~geomc/., ES

    Hurtado,  Mora &  Sacristan

Authors
  1. Chazelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Devillers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hurtado
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mora
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sacristan
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Teillaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chazelle, Devillers, Hurtado et al. Splitting a Delaunay Triangulation in Linear Time . Algorithmica 34, 39–46 (2002). https://doi.org/10.1007/s00453-002-0939-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-002-0939-8

Search

Navigation