Fast Delaunay Triangulation for Converging Point Relocation Sequences

This paper considers the problem of updating efficiently a Delaunay triangulation when vertices are moving under small perturbations. Its main contribution is a set of algo- rithms based on the concept of vertex tolerance. Experi- ments show that it is able to outperform the naive rebuild- ing algorithm in certain conditions. For instance, when points, in two dimensions, are relocated by Lloyd's iter- ations, our algorithm performs several times faster than rebuilding.