Automatic parallel generation of tetrahedral grids by using a domain decomposition approach

An algorithm for the automatic parallel generation of three-dimensional unstructured grids based on geometric domain decomposition is proposed. A software package based on this algorithm is described. Examples of generating meshes for some application problems on a multiprocessor computer are presented. It is shown that the parallel algorithm can significantly (by a factor of several tens) reduce the mesh generation time. Moreover, it can easily generate meshes with as many as $5\times10^7$ elements, which can hardly be generated sequentially. Issues concerning the speedup and the improvement of the efficiency of the computations and of the quality of the resulting meshes are discussed.