Parallel generation of meshes with cracks using binary spatial decomposition

This work describes a technique to generate tetrahedral meshes with cracks using parallel computers with distributed memory. This technique can be used for models without cracks as well. It employs a binary partitioning structure that uses axis-aligned planes to decompose the domain. Those decomposing planes are determined based on a refined octree that is built to estimate the amount of work necessary to generate the whole mesh, so that the amount of work in each subdomain is approximately the same. A serial advancing front technique is used in each subdomain concurrently, in such a way that the generated tetrahedra do not cross the decomposing planes. After local synchronizations, meshes are generated interfacing the subdomains. The results show that the prediction of the number of elements in each subdomain is accurate, leading to a well-balanced algorithm and to a good speed-up. Also, the meshes generated in parallel have very good quality, similar to the that of a serially generated mesh.

[1]  Luiz Fernando Martha,et al.  Surface mesh regeneration considering curvatures , 2008, Engineering with Computers.

[2]  Rainald Löhner,et al.  Recent Advances in Parallel Advancing Front Grid Generation , 2014, Archives of Computational Methods in Engineering.

[3]  Jirí Zára,et al.  Parallel Delaunay triangulation in E2 and E3 for computers with shared memory , 2005, Parallel Comput..

[4]  Barry Hilary Valentine Topping,et al.  Subdomain generation for non-convex parallel finite element domains , 1996 .

[5]  Edward Angel.  Interactive Computer Graphics: A Top-Down Approach using OpenGL (4th Edition) , 2005 .

[6]  Jirí Zára,et al.  Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory , 2004, Comput. Graph..

[7]  Rainald Löhner,et al.  A parallel advancing front grid generation scheme , 2000, International Journal for Numerical Methods in Engineering.

[8]  S. H. Lo,et al.  Parallel Delaunay triangulation in three dimensions , 2012 .

[9]  M. Shephard,et al.  Parallel volume meshing using face removals and hierarchical repartitioning , 1999 .

[10]  Dawei Zhao,et al.  Improvements in the reliability and element quality of parallel tetrahedral mesh generation , 2012 .

[11]  Nikos Chrisochoides,et al.  Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement , 2005, SIAM J. Sci. Comput..

[12]  Suzanne M. Shontz,et al.  MDEC: MeTiS-based Domain Decomposition for Parallel 2D Mesh Generation , 2011, ICCS.

[13]  E. N. Houstis,et al.  Parallel adaptive mesh generation and decomposition , 1996, Engineering with Computers.

[14]  Andrey N. Chernikov,et al.  Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement , 2006, SIAM J. Sci. Comput..

[15]  KohoutJosef,et al.  Parallel Delaunay triangulation in E2 and E3 for computers with shared memory , 2005 .

[16]  Nikos Chrisochoides,et al.  Simultaneous Mesh Generation and Partitioning for Delaunay Meshes , 2000, IMR.

[17]  George Karypis,et al.  Parmetis parallel graph partitioning and sparse matrix ordering library , 1997 .

[18]  L Lämmer,et al.  Parallel generation of triangular and quadrilateral meshes , 2000 .

[19]  Kazuhiro Nakahashi,et al.  Parallel unstructured mesh generation by an advancing front method , 2007, Math. Comput. Simul..

[20]  Seren Soner,et al.  Parallel Mesh Generation, Migration and Partitioning for the Elmer Application , 2022 .

[21]  David L. Millman,et al.  Parallel geometric algorithms for multi-core computers , 2009, SCG '09.

[22]  B. G. Larwood,et al.  Domain decomposition approach for parallel unstructured mesh generation , 2003 .

[23]  Joaquim B. Cavalcante Neto,et al.  An Algorithm for Three-Dimensional Mesh Generation for Arbitrary Regions with Cracks , 2001, Engineering with Computers.

[24]  Joaquim B. Cavalcante Neto,et al.  An Algorithm for Three-Dimensional Mesh Generation for Arbitrary Regions with Cracks , 1999, XII Brazilian Symposium on Computer Graphics and Image Processing (Cat. No.PR00481).

[25]  Jaime Peraire,et al.  Parallel unstructured mesh generation , 1996 .

[26]  Jianya Gong,et al.  ParaStream: A parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures , 2011, Comput. Geosci..

[27]  Heiko Andrä,et al.  Domain Decomposition Approach for Automatic Parallel Generation of Tetrahedral Grids , 2006 .

[28]  S. H. Lo.  Parallel Delaunay triangulation-Application to two dimensions , 2012 .

[29]  Barry Hilary Valentine Topping,et al.  Parallel adaptive tetrahedral mesh generation by the advancing front technique , 1998 .

[30]  Andriy Fedorov,et al.  Parallel decoupled terminal-edge bisection method for 3D mesh generation , 2006, Engineering with Computers.

[31]  Barry Hilary Valentine Topping,et al.  Parallel adaptive mesh generation , 1991 .

[32]  Joaquim B. Cavalcante Neto,et al.  A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains , 2013, Adv. Eng. Softw..

[33]  Edward Angel,et al.  Interactive Computer Graphics: A Top-Down Approach Using OpenGL , 1997 .

[34]  Barry Hilary Valentine Topping,et al.  Parallel and distributed adaptive quadrilateral mesh generation , 1999 .

[35]  Tomasz Jurczyk,et al.  Domain Decomposition Techniques for Parallel Generation of Tetrahedral Meshes , 2008, ICCS.

[36]  Peter K. Jimack,et al.  Efficient parallel generation of partitioned, unstructured meshes , 1996 .

[37]  Nikos Chrisochoides,et al.  A Framework for Parallel Unstructured Grid Generation for Complex Aerodynamic Simulations , 2009 .

[38]  Ian Smith,et al.  A general purpose system for finite element analyses in parallel , 2000 .