Almost regular Delaunay-triangulations
Alexander Fuchs · International Journal for Numerical Methods in Engineering · 1997
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. © 1997 John Wiley & Sons, Ltd.