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(H3 P ) of the size of any Delaunay mesh of P with bounded radius-edge ratio. The term HP 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. Key words: mesh generation, Delaunay triangulation, radius-edge ratio, aspect ratio, gradedness

• Type: Journal
• Year: 2006
• Where: COMGEO
• Authors: Siu-Wing Cheng
• Keywords: Applied Computing, COMGEO 2006, Delaunay Refinement Algorithms, Mesh, Radius-edge Ratio