Almost regular Delaunay-triangulations

An algorithm for constructing Almost Regular Triangulations (ARTs) for polygonal domains is described. The new feature of this method is that not only the geometric characteristics but also the combinatorial structure of the triangulations is optimized. This leads to grids with very few irregular vertices, i.e. most interior vertices have six neighbours as do triangulations consisting entirely of equilateral triangles