کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1139572 | 1489408 | 2014 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
There are simple and robust refinements (almost) as good as Delaunay
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: There are simple and robust refinements (almost) as good as Delaunay There are simple and robust refinements (almost) as good as Delaunay](/preview/png/1139572.png)
چکیده انگلیسی
A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The proposed partition joins together ideas of the Seven Triangle Longest-Edge partition (7T-LE), and the classical criteria for constructing Delaunay meshes. The new partition performs similarly compared to the Delaunay triangulation (7T-D) with the benefit of being more robust and with a cheaper cost in computation. It will be proved that in most of the cases the 7T-QD is equal to the 7T-D. In addition, numerical tests will show that the difference on the minimum angle obtained by the 7T-QD and by the 7T-D is negligible.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematics and Computers in Simulation - Volume 106, December 2014, Pages 84-94
Journal: Mathematics and Computers in Simulation - Volume 106, December 2014, Pages 84-94
نویسندگان
Alberto Márquez, Auxiliadora Moreno-González, Ángel Plaza, José P. Suárez,