Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Guaranteed-quality Delaunay meshing in 3D (short version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Generating well-shaped d-dimensional Delaunay meshes
Theoretical Computer Science - Computing and combinatorics
A time efficient Delaunay refinement algorithm
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Triangulations with locally optimal Steiner points
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Three-dimensional delaunay refinement for multi-core processors
Proceedings of the 22nd annual international conference on Supercomputing
Generalized Two-Dimensional Delaunay Mesh Refinement
SIAM Journal on Scientific Computing
Delaunay refinement algorithms for triangular mesh generation
Computational Geometry: Theory and Applications
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software
Journal of Experimental Algorithmics (JEA)
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.00 |
Traditional refinement algorithms insert a Steiner point from a few possible choices at each step. Our algorithm, on the contrary, defines regions from where a Steiner point can be selected and thus inserts a Steiner point among an infinite number of choices. Our algorithm significantly extends existing generalized algorithms by increasing the number and the size of these regions. The lower bound for newly created angles can be arbitrarily close to $30^{\circ}$. Both termination and good grading are guaranteed. It is the first Delaunay refinement algorithm with a $30^{\circ}$ angle bound and with grading guarantees. Experimental evaluation of our algorithm corroborates the theory.