Parallel Delaunay Research Articles

Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

We describe a distributed memory parallel Delaunay refinement algorithm for simple polyhedral domains whose constituent bounding edges and surfaces are separated by angles between 90° to 270° inclusive. With these constraints, our algorithm can generate meshes containing tetrahedra with circumradius to shortest edge ratio less than 2, and can tolerate more than 80% of the communication latency caused by unpredictable and variable remote gather operations. Our experiments show that the algorithm is efficient in practice, even for certain domains whose boundaries do not conform to the theoretical limits imposed by the algorithm. The algorithm we describe is the first step in the development of much more sophisticated guaranteed-quality parallel mesh generation algorithms.

Parallel Delaunay triangulation in E3: make it simple

The randomized incremental insertion algorithm of Delaunay triangulation in E3 is very popular due to its simplicity and stability. This paper describes a new parallel algorithm based on this approach. The goals of the proposed parallel solution are not only to make it efficient but also to make it simple. The algorithm is intended for computer architectures with several processors and shared memory. Several versions of the proposed method were tested on workstations with up to eight processors and on datasets of up to 200000 points with favorable results.

Distributed parallel Delaunay mesh generation

The demand for larger meshes motivates the development of efficient parallel automatic mesh generators. A parallel mesh generator can make efficient use of multi-processor computers and of the widespread availability of workstation networks. In this paper distributed parallel unstructured mesh generation for two and three-dimensional problems is demonstrated. Very large meshes up to 50 million elements have been generated on computers with medium sized resources.

Design and Implementation of a Practical Parallel Delaunay Algorithm

This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there have been many theoretical parallel algorithms for the problem, and some implementations based on bucketing that work well for uniform distributions, there has been little work on implementations for general distributions. We use the well known reduction of 2D Delaunay triangulation to find the 3D convex hull of points on a paraboloid. Based on this reduction we developed a variant of the Edelsbrunner and Shi 3D convex hull algorithm, specialized for the case when the point set lies on a paraboloid. This simplification reduces the work required by the algorithm (number of operations) from O(n log 2 n) to O(n log n) . The depth (parallel time) is O( log 3 n) on a CREW PRAM. The algorithm is simpler than previous O(n log n) work parallel algorithms leading to smaller constants.

A parallel Monte‐Carlo finite‐element procedure for the analysis of multicomponent random media

AbstractWe present a new first‐principle framework for the prediction of effective properties and statistical correlation lengths for multicomponent random media. The methodology is based upon a variational hierarchical decomposition procedure which recasts the original multiscale problem as a sequence of three scale‐decoupled subproblems. The focus of the current paper is the computationally intensive mesoscale subproblem, which comprises: Monte‐Carlo acceptance–rejection sampling; domain generation and parallel partition based on Voronoi tesselation; parallel Delaunay mesh generation; homogenization‐theory formulation of the governing equations; finite‐element discretization; parallel iterative solution procedures; and implementation on message‐passing multicomputers, here the Intel iPSC/860 hypercube. Two (two‐dimensional) problems of practical importance are addressed: heat conduction in random fibrous composites, and creeping flow through random fibrous porous media.