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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01179401
Contributor : Olivier Devillers <>
Submitted on : Wednesday, July 22, 2015 - 2:17:02 PM
Last modification on : Wednesday, July 31, 2019 - 3:02:38 PM

Identifiers

Collections

Citation

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, et al.. Splitting a Delaunay Triangulation in Linear Time. Proceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩. ⟨hal-01179401⟩

Share

Metrics

Record views

224