Splitting a Delaunay Triangulation in Linear Time

Abstract : Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072462
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:01:40 AM
Last modification on : Wednesday, October 30, 2019 - 7:36:17 PM
Long-term archiving on : Sunday, April 4, 2010 - 11:08:47 PM

Identifiers

  • HAL Id : inria-00072462, version 1

Collections

Citation

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, et al.. Splitting a Delaunay Triangulation in Linear Time. RR-4160, INRIA. 2001. ⟨inria-00072462⟩

Share

Metrics

Record views

191

Files downloads

711