超ロバスト計算原理セミナー(2月4日)

投稿日:2004/01/30投稿者:杉原厚吉
超ロバスト計算原理「ロバスト幾何計算」セミナー

講演者:  Professor Chee Yap
         (New York University and Seoul National University)

テーマ:  Complete Subdivision Algorithm for Intersecting 
Elementary Bezier Curves

日 時:  2004 年 2 月 4 日 (水) 15 時〜16 時

会 場: 東京大学工学部 6 号館 3 階セミナー室A

概 要: 
   Computing curve intersection is a fundamental problem
in geometric modeling.  The subdivision approach 
is the most widely used method for intersecting
curves in the Bezier form. Unfortunately, current algorithms 
are incomplete because they use an arbitrary $\\varepsilon$ 
cut-off to stop the subdivision process.  In this talk, 
we give a complete subdivision algorithm for intersecting 
a pair $(F,G)$ of elementary Bezier curves.

   Elementary Bezier curves are graphs of convex or concave 
functions.  Our key contribution is to introduce algebraic 
separation bounds into subdivision algorithms.  We also 
introduce a distinction between implicit and explicit 
representation of geometric objects such as curves.

連絡先:杉原厚吉 (内線 26905)