کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10335957 | 691825 | 2005 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A complete and non-overlapping tracing algorithm for closed loops
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A complete and non-overlapping tracing algorithm for closed loops A complete and non-overlapping tracing algorithm for closed loops](/preview/png/10335957.png)
چکیده انگلیسی
A procedure for tracing completely closed loops given implicitly by the intersection of two regular surfaces, without resorting to the parametric domain subdivisions or resulting in arc overlapping, is presented. Our primary hypothesis is that the rotation index, a global geometrical property, may be a useful complementary tool to the local differential geometrical properties for improving the efficiency of the well-known marching-based surface-surface intersection algorithms. To validate this hypothesis, we devised a novel approach for incrementally computing the rotation index of a closed plane curve given implicitly while the curve is traced. Moreover, we also proposed its integration in a marching procedure that employs adaptative circular steps.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Aided Geometric Design - Volume 22, Issue 6, September 2005, Pages 491-514
Journal: Computer Aided Geometric Design - Volume 22, Issue 6, September 2005, Pages 491-514
نویسندگان
Wu Shin-Ting, Osmar Aléssio, Sueli I.R. Costa,