Revisiting Optimal Delaunay Triangulation for 3D Graded Mesh Generation
نویسندگان
چکیده
This paper proposes a new algorithm to generate a graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proposes a proper way of injecting a background density function into the objective function minimized by ODT. This continuous/analytic point of view leads to an objective function that is continuous and Delaunay consistent, in contrast with the discrete/geometrical point of view developed in previous work. To optimize the objective function, this paper proposes a hybrid algorithm that combines a local search (quasi-Newton) with a global optimization (simulated annealing). The benefits of the method are both improved performances and an improved quality of the result in terms of dihedral angles. This results from the combination of two effects. First, the local search has a faster speed of convergence than previous work due to the better behavior of the objective function, and second, the algorithm avoids getting stuck in a poor local minimum. Experimental results are evaluated and compared using standard metrics.
منابع مشابه
Revisiting Delaunay Refinement Triangular Mesh Generation on Curve-bounded Domains
An extension of Shewchuk’s Delaunay Refinement algorithm to planar domains bounded by curves is presented. A novel method is applied to construct constrained Delaunay triangulations from such geometries. The quality of these triangulations is then improved by inserting vertices at carefully chosen locations. Amendments to Shewchuk’s insertion rules are necessary to handle cases resulting from t...
متن کاملMetric 3D Surface Mesh Generation Using Delaunay Criteria
This paper presents a technique of incorporating anisotropic metric into the Delaunay triangulation algorithm for unstructured mesh generation on 3D parametric surfaces. Both empty circumcircle and inner angles criteria of Delaunay retriangulation can be successfully used with the developed method of coordinate transformation with little adjustments. We investigate the efficiency of mesh genera...
متن کامل3-D Automatic Mesh Generation for FEA Using Dynamic Bubble System
|In this paper, an extension of the previously developed 2-D dynamic bubble system for 3-D automatic mesh generation using tetrahedral nite elements is presented. Initially, set of vertices inside the entire analysis region is generated using 3-D dynamic bubble system, followed by automatic mesh generation according to the Delaunay tessellation algorithm and the generated set of vertices. The p...
متن کاملGraded Delaunay Decoupling Method for Parallel Guaranteed Quality Planar Mesh Generation
We present a method for creating large 2D graded, guaranteed quality, Delaunay meshes on parallel machines. The method decouples the mesh generation procedure for each subdomain, and thus eliminates the communication between processors, while the final mesh is of guaranteed quality. This work extents our previous result on the uniform Delaunay Decoupling method [19], by allowing the element siz...
متن کاملWhere and How Chew's Second Delaunay Refinement Algorithm Works
Chew’s second Delaunay refinement algorithm with offcenter Steiner vertices leads to practical improvement over Ruppert’s algorithm for quality mesh generation, but the most thorough theoretical analysis is known only for Ruppert’s algorithm. A detailed analysis of Chew’s second Delaunay refinement algorithm with offcenters is given, improving the guarantee of well-graded output for any minimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 36 شماره
صفحات -
تاریخ انتشار 2014