کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
440436 | 691022 | 2009 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computing handle and tunnel loops with knot linking
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Many applications seek to identify features like ‘handles’ and ‘tunnels’ in a shape bordered by a surface, embedded in three dimensions. To this end, we define handle and tunnel loops on surfaces which can help identify these features. We show that a closed surface of genus gg always has gg handle and gg tunnel loops induced by the embedding. For a class of shapes that retract to graphs, we characterize these loops by a linking condition with these graphs. These characterizations lead to algorithms for detection and generation of these loops. We provide an implementation with applications to feature detection and topology simplification to show the effectiveness of the method.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer-Aided Design - Volume 41, Issue 10, October 2009, Pages 730–738
Journal: Computer-Aided Design - Volume 41, Issue 10, October 2009, Pages 730–738
نویسندگان
Tamal K. Dey, Kuiyu Li, Jian Sun,