论文信息 - Parallel three-dimensional mesh generation

Parallel three-dimensional mesh generation

Abstract This paper discusses the development of an automatic mesh generation technique designed to effectively operate on multiple instruction, multiple data (MIMD) parallel computers. The paper first provides an overview of a new octree-based procedure designed for the parallel generation of meshes of large numbers of elements directly from solid model representations. The techniques required to implement such a procedure using message passing on MIMD computers are emphasized. Technical issues considered include the region meshing algorithm, multiple octant migration and incremental load balancing.

[1] M. Shephard,et al. Reliability of automatic 3D mesh generation , 1992 .

[2] Mark S. Shephard,et al. Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[3] D. Mavriplis. An advancing front Delaunay triangulation algorithm designed for robustness , 1993 .

[4] S. H. Lo,et al. Delaunay triangulation of non‐convex planar domains , 1989 .

[5] Marshal L. Merriam,et al. An efficient advancing front algorithm for Delaunay triangulation , 1991 .

[6] N. Weatherill,et al. Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[7] M. Saxena,et al. Parallel fem algorithms based on recursive spatial decomposition—I. Automatic mesh generation , 1992 .

[8] M. Shephard,et al. A combined octree/delaunay method for fully automatic 3‐D mesh generation , 1990 .

[9] Rainald Löhner,et al. Parallel unstructured grid generation , 1991 .

[10] Joseph E. Flaherty,et al. Parallel adaptive mesh refinement and redistribution on distributed memory computers , 1994 .