Splitting a Delaunay Triangulation in Linear Time - Archive ouverte HAL Access content directly
Conference Papers Year :

Splitting a Delaunay Triangulation in Linear Time

(1) , (2) , (3) , (3) , (4) , (2)
1
2
3
4

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.

Dates and versions

hal-01179401 , version 1 (22-07-2015)

Identifiers

Cite

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⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More