Splitting a Delaunay Triangulation in Linear Time1

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… (More)

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Chazelle2002SplittingAD, title={Splitting a Delaunay Triangulation in Linear Time1}, author={Bernard Chazelle and Olivier Devillers and Francisco Due{\~n}as Hurtado and Maria F Mora and Vera Sacrist{\'a}n and Monique Teillaud}, year={2002} }