A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation

We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size" guarantees: ?All triangles have a bounded aspect ratio.?The number of triangles is within a constant factor of optimal. Such "quality" triangulations are desirable as meshes for the finite element method, in which the running time generally increases with the number of triangles, and where the convergence and stability may be hurt by very skinny triangles. The technique we use-successive refinement of a Delaunay triangulation-extends a mesh generation technique of Chew by allowing triangles of varying sizes. Compared with previous quadtree-based algorithms for quality mesh generation, the Delaunay refinement approach is much simpler and generally produces meshes with fewer triangles. We also discuss an implementation of the algorithm and evaluate its performance on a variety of inputs.

[1]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1991, SMA '91.

[2]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[3]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[4]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[5]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Jim Ruppert,et al.  A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[7]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[8]  D. Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[9]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[10]  Elefterios A. Melissaratos,et al.  Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes , 1992, SCG '92.

[11]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[12]  J. Ruppert.  Results on triangulation and high quality mesh generation , 1992 .

[13]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[14]  D. A. Field,et al.  Implementing Watson's algorithm in three dimensions , 1986, SCG '86.

[15]  Brenda S. Baker,et al.  Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..

[16]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.