Document Type
Article
Publication Date
2010
DOI
10.1137/090763226
Publication Title
SIAM Journal on Scientific Computing
Volume
32
Issue
5
Pages
2659-2686
Abstract
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.
Original Publication Citation
Foteinos, P. A., Chernikov, A. N., & Chrisochoides, N. P. (2010). Fully generalized two-dimensional constrained Delaunay mesh refinement. SIAM Journal on Scientific Computing, 32(5), 2659-2686. doi:10.1137/090763226
Repository Citation
Foteinos, P. A., Chernikov, A. N., & Chrisochoides, N. P. (2010). Fully generalized two-dimensional constrained Delaunay mesh refinement. SIAM Journal on Scientific Computing, 32(5), 2659-2686. doi:10.1137/090763226
Comments
© Society for Industrial and Applied Mathematics.
"The Author may post the final published version of the Work on the Author's personal web site and on the web server of the Author's institution, provided that proper notice of the Publisher's copyright is included and that no separate or additional fees are collected for access to or distribution of the work."