This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: s ( u ) consisting of segments s ( u ) and s 1 ( u ) at u = 1 , u = 2 , u = 5 , and u = 7 in order to draw s ( n ) and the respective Bezier polygons over the interval [0 , 9]. ( 10 points ) 7.3. For distinct points P , P 1 , . . . , P n , the Bezier curve of order n ( n = 0 , 1 , 2 , . . . ) can be recur-sively deﬁned by B ( t, P ) := P B n ( t, P , . . . , P n ) := (1-t ) · B n-1 ( t, P , . . . , P n-1 ) + t · B n-1 ( t, P 1 , . . . , P n ) ( n > 0) where 0 ≤ t ≤ 1. Show that for any non-negative integer n , the Bezier curve of order n is given by the equation B n ( t, P , . . . , P n ) = n X k =0 ± n k ² t k (1-t ) n-k · P k ( 7 points ) Due: 26.03.10, at 3 pm (in the mailbox labeled Linsen in the entrance hall of Res.I )...
View Full Document
This note was uploaded on 05/18/2010 for the course MATHEMATIC 120102 taught by Professor Xxxxxxxxxyyyyyy during the Spring '10 term at Jacobs University Bremen.
- Spring '10