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

Abstract

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 x 10(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

Interactive computation and visualization of deep brain stimulation effects using Duality

“…In contrast, as previously mentioned, a further speed-up of the mesh generation through parallelization is less easy to achieve. A combination of the existing methods based on domain decomposition (Lo 2012;Andrä et al 2008) and the here presented precomputation of the FEM mesh around the DBS lead would be desirable. An easier possibility to speed-up the generation of the FEM mesh is to accelerate the merging of the precomputed mesh around the DBS lead with the on-the-fly generated mesh of the brain volume.…”

Application of the erosion algorithm in modeling of structures behavior under impulse loads

“…Multiple algorithms modify the mesh only in two-dimensional case [7]. Parallel computations have recently become of great concern while developing and modification of finite-element meshes [8].…”