Automatic Grid Generation with Almost regular Delaunay Tetrahedra

Proceedings, 7th International Meshing Roundtable, Sandia National Lab, pp.133-148, October 1998

MESHING
RESEARCH
CORNER

7th International Meshing Roundtable
October 26-28, 1998
Dearborn, Michigan, USA

Department of Mathematics A
University of Stuttgart
Pfaffenwaldring 57, D-70569 Stuttgart, Germany
Email: fuchs@mathematik.uni-stuttgart.de

Abstract
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 R3 with congruent tetrahedra

Download Full Paper (Postscript Format)