Efficient parallel generation of partitioned, unstructured meshes
Advances in Engineering Software
Simultaneous mesh generation and partitioning for Delaunay meshes
Mathematics and Computers in Simulation - IMACS sponsored special issue: 1999 international symposium on computational sciences, to honor John R. Rice
An Algorithm for Two-Dimensional Mesh Generation for Arbitrary Regions with Cracks
SIBGRAPI '99 Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing
Delaunay refinement mesh generation
Delaunay refinement mesh generation
Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Refinement
SIAM Journal on Scientific Computing
Parallel decoupled terminal-edge bisection method for 3D mesh generation
Engineering with Computers
Parallel Guaranteed Quality Delaunay Uniform Mesh Refinement
SIAM Journal on Scientific Computing
Parallel unstructured mesh generation by an advancing front method
Mathematics and Computers in Simulation
Surface mesh regeneration considering curvatures
Engineering with Computers
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
This work describes a technique for generating two-dimensional triangular meshes using distributed memory parallel computers, based on a master/slaves model. This technique uses a coarse quadtree to decompose the domain and a serial advancing front technique to generate the mesh in each subdomain concurrently. In order to advance the front to a neighboring subdomain, each subdomain suffers a shift to a Cartesian direction, and the same advancing front approach is performed on the shifted subdomain. This shift-and-remesh procedure is repeatedly applied until no more mesh can be generated, shifting the subdomains to different directions each turn. A finer quadtree is also employed in this work to help estimate the processing load associated with each subdomain. This load estimation technique produces results that accurately represent the number of elements to be generated in each subdomain, leading to proper runtime prediction and to a well-balanced algorithm. The meshes generated with the parallel technique have the same quality as those generated serially, within acceptable limits. Although the presented approach is two-dimensional, the idea can be easily extended to three dimensions.