Splitting a Delaunay Triangulation in Linear Time

Abstract : Computing the Delaunay triangulation of n points is well known to have an Ω(n log n) lower bound. Researchers have attempted to break that bound in special cases where additional information is known.
Type de document :
Communication dans un congrès
European Symposiumon Algorithms, 2001, Aarhus, Denmark. springer, 2161, pp.312-320, LNCS. 〈http://www.brics.dk/esa2001/〉. 〈10.1007/3-540-44676-1_26〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01179401
Contributeur : Olivier Devillers <>
Soumis le : mercredi 22 juillet 2015 - 14:17:02
Dernière modification le : samedi 27 janvier 2018 - 01:30:53

Identifiants

Collections

Citation

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, et al.. Splitting a Delaunay Triangulation in Linear Time. European Symposiumon Algorithms, 2001, Aarhus, Denmark. springer, 2161, pp.312-320, LNCS. 〈http://www.brics.dk/esa2001/〉. 〈10.1007/3-540-44676-1_26〉. 〈hal-01179401〉

Partager

Métriques

Consultations de la notice

175