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

Splitting a Delaunay Triangulation in Linear Time


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.
Fichier principal
Vignette du fichier
algorithmica.pdf (122.75 Ko) Télécharger le fichier

Dates and versions

inria-00090664 , version 1 (01-09-2006)



Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, et al.. Splitting a Delaunay Triangulation in Linear Time. Algorithmica, 2002, 34 (1), pp.39--46. ⟨10.1007/s00453-002-0939-8⟩. ⟨inria-00090664⟩
171 View
18688 Download



Gmail Facebook Twitter LinkedIn More