FULLY GENERALIZED TWO-DIMENSIONAL CONSTRAINED DELAUNAY MESH REFINEMENT

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 degrees. Both termination and good grading are guaranteed. It is the first Delaunay refinement algorithm with a 30 degrees angle bound and with grading guarantees. Experimental evaluation of our algorithm corroborates the theory.