Generalized Two-Dimensional Delaunay Mesh Refinement
- 1 January 2009
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 31 (5), 3387-3403
- https://doi.org/10.1137/080723028
Abstract
Delaunay refinement is a popular mesh generation method which makes it possible to derive mathematical guarantees with respect to the quality of the elements. Traditional Delaunay refinement algorithms insert Steiner points in a small enumerable number (one or two) of specific positions inside circumscribed circles of poor quality triangles and on encroached segments. In this paper we prove that there exist entire two-dimensional and one-dimensional regions that can be used for the insertion of Steiner points (innumerable number of choices), while the guarantees on mesh quality can be preserved. This result opens up the possibility to use multiple point placement strategies, all covered by a single proof. In addition, the parallelization of this generalized algorithm immediately implies the parallelization for each individual point placement method.Keywords
This publication has 9 references indexed in Scilit:
- Graded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh GenerationSIAM Journal on Scientific Computing, 2008
- Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh RefinementSIAM Journal on Scientific Computing, 2006
- Parallel Guaranteed Quality Delaunay Uniform Mesh RefinementSIAM Journal on Scientific Computing, 2006
- Generating well-shaped d-dimensional Delaunay MeshesTheoretical Computer Science, 2003
- Delaunay refinement algorithms for triangular mesh generationComputational Geometry, 2002
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJournal of Algorithms, 1995
- Selective refinement: A new strategy for automatic node placement in graded triangular meshesInternational Journal for Numerical Methods in Engineering, 1987
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981