The Adaptive Delaunay Tessellation: A neighborhood covering meshing technique

In this paper we propose an unstructured hybrid tessellation of a scattered point set that minimally covers the proximal space around each point. The mesh is automatically obtained in a bounded period of time by transforming an initial Delaunay tessellation. Novel types of polygonal interpolants are used for interpolation applications and the geometric qualities of the elements make them also useful for discretization schemes. The approach proves to be superior to classical Delaunay one in a finite element context