On the sizes of Delaunay meshes

Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H"P^3) of the size of any Delaunay mesh of P with bounded radius-edge ratio. The term H"P depends on the geometry of P and it is likely a small constant when the boundaries of P are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.

[1]  Sheung-Hung Poon,et al.  Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio , 2003, SODA '03.

[2]  S. Teng,et al.  On the Radius-Edge Condition in the Control Volume Method , 1999 .

[3]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[4]  Tamal K. Dey,et al.  Quality meshing with weighted Delaunay refinement , 2002, SODA '02.

[5]  Scott A. Mitchell,et al.  Quality Mesh Generation in Higher Dimensions , 2000, SIAM J. Comput..

[6]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.

[7]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[8]  Tamal K. Dey,et al.  Quality meshing for polyhedra with small angles , 2004, SCG '04.

[9]  Xiang-Yang Li,et al.  Generating well-shaped Delaunay meshed in 3D , 2001, SODA '01.

[10]  Gary L. Miller,et al.  A Delaunay based numerical method for three dimensions: generation, formulation, and partition , 1995, STOC '95.

[11]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[12]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

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

[14]  Herbert Edelsbrunner,et al.  Sliver exudation , 2000, J. ACM.

[15]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[16]  Herbert Edelsbrunner,et al.  An Experimental Study of Sliver Exudation , 2002, Engineering with Computers.