کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
414775 681033 2013 25 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
چکیده انگلیسی

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n  -well-centered. These conditions, together with some other observations, are used to describe restrictions on the local combinatorial structure of simplicial meshes in which every simplex is well-centered. In particular, it is shown that in a 3-well-centered (2-well-centered) tetrahedral mesh there are at least 7 (9) edges incident to each interior vertex, and these bounds are sharp. Moreover, it is shown that, in stark contrast to the 2-dimensional analog, where there are exactly two vertex links that prevent a well-centered triangle mesh in R2R2, there are infinitely many vertex links that prohibit a well-centered tetrahedral mesh in R3R3.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computational Geometry - Volume 46, Issue 6, August 2013, Pages 700–724
نویسندگان
, , , , ,