Parallel mesh generation: Difference between revisions

Revision as of 16:52, 24 September 2007

Revision as of 19:37, 24 September 2007

Line 36:

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 algorithmsalgorithm for parallel

Delaunay triangulations appears in [8]. This algorithm is extended

in [9] for parallel mesh generation.

==References==