We have developed efficient routines to create and update a Delaunay triangulation around a 2D set of irregularly distributed data points