Parallel mesh generation: Difference between revisions

Revision as of 19:14, 13 May 2008

Revision as of 19:15, 13 May 2008

Line 12:

There is a difference between parallel mesh generation and parallel triangulation. In parallel triangulation a pre-defined set of points is used to generate in parallel triangles that cover the convex hull of the set of points. A very efficient algorithm for parallel Delaunay triangulations appears in Blelloch et al.<ref>G. E. Blelloch, J.C. Hardwick, G.~L. Miller, and D. Talmor, Design and implementation of a practical parallel Delaunay algorithm, Algorithmica, 24 (1999), pp. 243--269.</ref>. This algorithm is extended in Clemens and Walkington<ref>Clemens Kadow and Noel Walkington. Design of a projection-based parallel Delaunay mesh generation and refinement algorithm. In proceedings of Fourth Symposium on Trends in Unstructured Mesh Generation, 2003.</ref> for parallel mesh generation.

While many solvers have been ported to parallel machines, grid generators have left behind. Still the preprocessing step of mesh generation remains a sequential bottleneck in the simulation cycle. That is why the need for developing of stable 3D parallel grid generator is well-justified. Work in this direction is carried out by several institutions <ref>http://Fraunhofer Institute for Industrial Mathematics, http://www.itwm.fhg.de</ref>. '''parTgen'''<ref>parTgen - partitioner and parallel tetrahedral mesh generator, http://www.itwm.fhg.de/en/hpc__partgen/partgen/</ref> - partitioner and parallel tetrahedral mesh generator is an example of decoupled method developed by Ivanov et al.<ref>E.G. Ivanov, H. Andrae and A.N. Kudryavtsev, Domain Decomposition Approach for Automatic Generation of Tetrahedral Grids, Int. Math. Journ. Computational Methods in Applied Mathematics, Vol.6(2), 2006, pp.~178--193. </ref>

==References==