Splitting a Delaunay Triangulation in Linear Time
Résumé
Computing the Delaunay triangulation of n points requires usually a minimum of Omega(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.
Domaines
Géométrie algorithmique [cs.CG]
Loading...