کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
415903 681255 2006 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the sizes of Delaunay meshes
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
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 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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computational Geometry - Volume 33, Issue 3, February 2006, Pages 130-138