Improved Mesh Generation: Not Simple but Good
Neugebauer, Friedhelm and Ralf Diekmann
5th International Meshing Roundtable, Sandia National Laboratories, pp.257-272, October 1996
An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert [1]. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to generate meshes with provably good angle bounds between 30 degrees and 90 degrees (except probably smaller angles of the polygonal boundary given as input).
Download Full Paper (Postscript Format)
Contact author(s) or publisher for availability and copyright information on above referenced article