Splitting a Delaunay Triangulation in Linear Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

Splitting a Delaunay Triangulation in Linear Time

Olivier Devillers
Ferran Hurtado
  • Function : Author
Mercè Mora
  • Function : Author
Vera Sacristán
  • Function : Author
Monique Teillaud


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4160.pdf (227.69 Ko) Télécharger le fichier

Dates and versions

inria-00072462 , version 1 (24-05-2006)


  • HAL Id : inria-00072462 , version 1


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⟩
65 View
457 Download


Gmail Facebook Twitter LinkedIn More