Automatic Grid Generation with Almost Regular Delaunay Tetrahedra

An algorithm for constructing almost regular triangulations (ARTs) for three-dimensional polygonal domains is described. Ideally such triangulations consist entirely of congruent tetrahedra with nearly equal edges. The new feature of this method is that the position of the vertices is adjusted, before any connecting edges are assigned. This leads to grids with very few irregular vertices, i.e. most interior vertices are shared by 24 tetrahedra as for regular tessellations of R 3 with congruent tetrahedra.