کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
415851 | 681245 | 2006 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a given regular lattice. For this purpose, a polyhedral approximation is used to reconstruct their boundary structure. In the planar case d=2, the performance and precision of the algorithm is studied on various examples of particular polyconvex sets. The algorithm is implemented in Java for two different approximation systems. The results of numerical experiments are compared with those obtained by other methods known in the literature.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computational Geometry - Volume 34, Issue 3, July 2006, Pages 127-148
Journal: Computational Geometry - Volume 34, Issue 3, July 2006, Pages 127-148