Parallel Delaunay Refinement: Algorithms and Analyses

@article{Spielman2002ParallelDR,
  title={Parallel Delaunay Refinement: Algorithms and Analyses},
  author={Daniel A. Spielman and Shang-Hua Teng and Alper {\"U}ng{\"o}r},
  journal={Int. J. Comput. Geometry Appl.},
  year={2002},
  volume={17},
  pages={1-30}
}
In this paper, we analyze the omplexity of natural parallelizations of Delaunay re nement methods for mesh generation. The parallelizations employ a simple strategy: at ea h iteration, they hoose a set of \independent" points to insert into the domain, and then update the Delaunay triangulation. We show that su h a set of independent points an be onstru ted eÆ iently in parallel and that the number of iterations needed is O(log2(L/s)), where L is the diameter of the domain, and s is the… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS