An automatic mesh coarsening technique for Delaunay triangulations

A new algorithm is described for automatic coarsening of Delaunay triangulations. The method automatically identifies the nodes of the mesh which are candidates for deletion in each region to be coarsened. The mesh coarsening procedure is to regenerate a Delaunay triangulation for all the remaining nodes in the solution domain. The adapted mesh retains a high quality for two reasons: (i) because a set of nodes have been used to obtain the coarse mesh, which are equidistant apart in some sense defined by the original mesh; (ii) because the triangulation is Delaunay. A two-dimensional example demonstrates the quality of the mesh after coarsening.