Splitting a Delaunay Triangulation in Linear Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2002

Splitting a Delaunay Triangulation in Linear Time

Résumé

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
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
149 Consultations
388 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More