Splitting a Delaunay Triangulation in Linear Time

Splitting a Delaunay Triangulation in Linear Time

0.00 Avg rating—0 Votes
Article ID: iaor20121115
Volume: 34
Issue: 1
Start Page Number: 39
End Page Number: 46
Publication Date: Sep 2002
Journal: Algorithmica
Authors: , , , , ,
Keywords: complexity
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.