Splitting a delaunay triangulation in linear time

B. Chazelle, O. Devillers, F. Hurtado, M. Mora, V. Sacristán, M. Teillaud

Research output: Contribution to journalArticle

28 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)39-46
Number of pages8
JournalAlgorithmica (New York)
Volume34
Issue number1
DOIs
StatePublished - 2002

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Keywords

  • Computational geometry
  • Delaunay triangulation
  • Randomized algorithms
  • Voronoi diagrams

Fingerprint Dive into the research topics of 'Splitting a delaunay triangulation in linear time'. Together they form a unique fingerprint.

  • Cite this

    Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., & Teillaud, M. (2002). Splitting a delaunay triangulation in linear time. Algorithmica (New York), 34(1), 39-46. https://doi.org/10.1007/s00453-002-0939-8