کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4643070 | 1341366 | 2007 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Verified convex hull and distance computation for octree-encoded objects
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Verified convex hull and distance computation for octree-encoded objects Verified convex hull and distance computation for octree-encoded objects](/preview/png/4643070.png)
چکیده انگلیسی
This paper discusses algorithms for computing verified convex hull and distance enclosure for objects represented by axis-aligned or unaligned octrees. To find a convex enclosure of an octree, the concept of extreme vertices of boxes on its boundary has been used. The convex hull of all extreme vertices yields an enclosure of the object. Thus, distance algorithms for convex polyhedra to obtain lower bounds for the distance between two octrees can be applied. Since using convex hulls makes it possible to avoid the unwanted wrapping effect that results from repeated decompositions, it also opens a way to dynamic distance algorithms for moving objects.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 199, Issue 2, 15 February 2007, Pages 358–364
Journal: Journal of Computational and Applied Mathematics - Volume 199, Issue 2, 15 February 2007, Pages 358–364
نویسندگان
Eva Dyllong, Wolfram Luther,