کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
442066 | 692041 | 2011 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computation of the minimum distance between two Bézier curves/surfaces
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computation of the minimum distance between two Bézier curves/surfaces Computation of the minimum distance between two Bézier curves/surfaces](/preview/png/442066.png)
چکیده انگلیسی
We present an efficient and robust method based on the culling approach for computing the minimum distance between two Bézier curves or Bézier surfaces. Our contribution is a novel dynamic subdivision scheme that enables our method to converge faster than previous methods based on binary subdivision.
Figure optionsDownload high-quality image (31 K)Download as PowerPoint slideHighlights
► Our algorithm computes the minimum distance between two Bézier curves/surfaces.
► For curve case, our algorithm is faster than the existing algorithms by about 21–93%.
► For surface case, our algorithm is faster than the binary subdivision by about 18–73%.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 35, Issue 3, June 2011, Pages 677–684
Journal: Computers & Graphics - Volume 35, Issue 3, June 2011, Pages 677–684
نویسندگان
Jung-Woo Chang, Yi-King Choi, Myung-Soo Kim, Wenping Wang,