A New Algorithm for Generating Tetrahedral Grids

Abstract

A new algorithm is presented for generating tetrahedral grids for bound domains of complicated structure and form that consist of the union of several subdomains. The grids obtained using the algorithm have regularity, in that there is no tetrahedron whose vertices lie at different sides of the subdomain boundaries. The algorithm has high fast-action: the time needed to generate a grid consisting of 10⁵−10⁶ tetrahedrons is approximately 20–40 seconds of the work of a standard personal computer. All steps of the algorithm are described in detail, and examples of generated grids are given.