Splitting a Delaunay Triangulation in Linear Time

Computing the Delaunay triangulation of n points requires usually a minimum of (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. Key Words. Computational geometry, Delaunay triangulation, Voronoi diagrams, Randomized algorithms.

• Type: Conference
• Year: 2001
• Where: ESA
• Authors: Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
• Keywords: Additional Knowledge, Algorithms, Delaunay Triangulation, ESA 2001, Randomized Expected Linear