Algorithm 870: A static geometric Medial Axis domain decomposition in 2D Euclidean space
ACM Transactions on Mathematical Software (TOMS)
Algorithm 872: Parallel 2D constrained Delaunay mesh generation
ACM Transactions on Mathematical Software (TOMS)
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Journal of Parallel and Distributed Computing
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A fast algorithm for constructing approximate medial axis of polygons, using Steiner points
Advances in Engineering Software
A distributed-memory parallel technique for two-dimensional mesh generation for arbitrary domains
Advances in Engineering Software
| Hi-index | 0.00 |
Creating in parallel guaranteed quality large unstructured meshes is a challenging problem. Parallel mesh generation procedures decompose the original mesh generation problem into smaller subproblems that can be solved in parallel. The subproblems can be treated as either completely or partially coupled, or they can be treated as completely decoupled. In this paper we present a parallel guaranteed quality Delaunay method for 2-dimensional domains which is based on the complete decoupling of the subproblems. As a result the method eliminates the communication and the synchronization during the meshing of the subproblems. Moreover, it achieves 100% code reuse of existing, fine-tuned, and well-tested sequential mesh generators. The approach we describe in this paper presents for the first time an effective way to create in parallel guaranteed quality meshes with billions of elements in a few hundreds of seconds, and at the same time demonstrates that these meshes can be generated in an efficient and scalable way. Our performance data indicate superlinear speedups.