A rational parametrization of Bezier like curves

Size: px
Start display at page:

Download "A rational parametrization of Bezier like curves"

Transcription

1 A rational parametrization of Bezier like curves Mohamed ALLAOUI and Aurélien GOUDJO arxiv: v1 [cs.cg] 27 Apr 2018 Résumé Une classe de paramétrisation rationnelle a été développée puis utilisée pour générer des fonctions de Bernstein. La nouvelle famille de bases obtenue dépend d un indice α (, 0) (1, + ), et pour un degré k IN, est formée de fonctions rationnelles dont le numérateur et le dénominateur sont de degré k. Ces bases de Bernstein rationnelles vérifient toutes les propriétés classiques notamment la positivité, la partition de l unité et constituent de véritables bases d approximation de fonctions continues. Les courbes de Bézier associées vérifient les propriétés classiques et on a obtenu les algorithmes d évaluation comme celui de decasteljau et de subdivision avec une complexité équivalente. Pour le même degré k et le même polygone de contrôle ces algorithmes convergent vers la même courbe de Bézier que le cas standard. Les bases de Bernstein polynomiales classiques se revèlent comme un cas asymptotique de la nouvelle classe. Mots clés : Fonctions de Bernstein rationnelles, Approximation de fonctions, Courbe de Bézier, Algorithme de decasteljau. Abstract In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index α (, 0) (1, + ), and for a given degree k IN, these basis functions are rational with a numerator and a denominator are polynomials of degree k. All of the classical properties as positivity, partition of unity are hold for these rational Bernstein basis and they constitute approximation basis functions for continuous functions spaces. The Bézier curves obtained verify the classical properties and we have the classical computational algorithms like the decasteljau Algorithm and the algorithm of subdivision with the similar accuracy. Given a degree k and a control polygon points all of these algorithms converge to the same Bézier curve as the classical case. That means the Bézier curve is independent of the index α. The classical polynomial Bernstein basis seems a asymptotic case of our new class of rational Bernstein basis. Keywords : Rational Bernstein functions, Functions approximation, Bézier curves, decasteljau Algorithm. Unité de Mathématiques IMSP/UP Département de Mathématiques FAST/UAC, aurelien.goudjo@uac.bj 1

2 Contents 1 Introduction 2 2 New class of rational Bézier like basis A class of rational parametrizations A new class of rational Bernstein functions Properties of the new Bernstein basis Properties of the new class of Bézier curves Geometric properties Algorithms for computing the Bézier curve Conclusion 27 1 Introduction We know that, for a Bézier curve B of degree n IN in IR d with d IN and 1 d 3, the polynomial Bernstein basis (B n i )n can be define for a < b IR and a parametrization x [a, b], by : ( ) n b x if i 0 B n i (x) b a ( ) i ( ) n i x a b x Cn i if 1 i n 1 ( b ) a b a n x a if i n b a 0 otherwise (1) where Cn i n! and 0! 1. i!(n i)! Let (d i ) n be the control points of B, d i IR d for all i then we have B(x) d i B n i (x), x [a, b] In the same way we define the rational Bernstein basis (R i ) n of degree n IN on [a, b] by R i (x) ω ib n i (x) ω j B n j (x) j0 where ω i > 0, i 0,..., n. We can then define the rational Bézier curves by substiting the polynomial basis by the rational one. 2

3 We observe the that, by putting w(x) x a b x we have 1 w(x) b a b a. Therefore, { B n C i i (x) n (w(x)) i (1 w(x)) n i if 0 i n and a x b 0 otherwise This function w we defined is increasing on [a, b] with w(a) 0 and w(b) 1. The goal here is to retain these properties while requiring that w is homographic, to get a basis Bernstein naturally formed, of rational functions of degree (k, k), ie a numerator of degree k and a denominator of degree k. 2 New class of rational Bézier like basis 2.1 A class of rational parametrizations We start with a lemma who fixed the foundation of our new class rational Bezier curves and can be expressed as follow : Lemma 2.1 Let a, b IR such that a < b. There exists H([a, b]) a family of the homographic functions strictly increasing f on [a, b] on [a, b] such that f(a) 0 and f(b) 1. More precisely, for all f H([a, b]) there exists a unique α ], 0[ ]1, + [ such that α(x a) f(x), x [a, b] x + (α 1)b αa ( Existence ) Since f is homographic such that f(a) 0, then there exist α 0 and α(x a) c IR\{ a, b} such that for all x [a, b] we have : f(x). We x + c α(b a) have f(b) 1 then 1. We get c (α 1)b αa. Since c / { a, b} b + c then we have α / {0, 1}. By strictly increasing of f we have α(α 1) > 0, and α ], 0[ ]1, + [. Therefore, we have { } α(x a) H([a, b]) f α f α (x), α ], 0[ ]1, + [, x [a, b] x + (α 1)b αa ( Uniqueness) 3

4 Let α, β ], 0[ ]1, + [ and f α, f β H([a, b]) the associate homographic functions f α f β f α (x) f β (x) x [a, b] α(x a) x + (α 1)b αa β(x a) x + (β 1)b βa (α β)(x b) 0 x [a, b] (α β)(x b) 0 x [a, b[ α β x [a, b] Remark 2.1 Let x [a, b] and α ], 0[ ]1, + [. We have D x + (α 1)b αa 0. Ideed???, we observe that D x b + α(b a) x a + (α 1)(b a), then we have (α 1)(b a) D α(b a). We can now write { 0 < α(α 1)(b a) αd α 2 (b a) if α > 1 0 < α 2 (b a) αd α(α 1)(b a) if α < 0 Then we conclude that D 0 x [a, b]. Remark 2.2 Let α ], 0[ ]1, + [ and a < b. Let f α H([a, b]) continuous and increasing strictly on [a, b] with f α ([a, b]) [0, 1]. Moreover, for λ [0, 1] and x a + λ(b a) [a, b] we have f α (x) λα [0, 1] λ + α 1 Thus obtaining the standard case as a asymptotic one : lim f α(x) λ x a α b a 2.2 A new class of rational Bernstein functions Definition 2.1 Let a, b IR such that a < b, α ], 0[ ]1, + [, f α H([a, b]) and n IN. A rational Bernstein basis of α index and degree n on [a, b], is a family ( α B n i )n of real functions defined for all x [a, b] ; (1 w(x)) n if i 0 Cn(w(x)) i i (1 w(x)) n i α B n i (x) if 1 i n 1 (w(x)) n if i n 0 otherwise where w(x) f α (x). It was agreed that α B 0 0(x) 1, x [a, b] and [a, b] the parametrization space ( or parameter space). (2) 4

5 Definition 2.2 Let n, d IN and a, b IR such that a < b. Let α ], 0[ ]1, + [ and (d i ) n IRd. A rational Bézier curve of α index, degree n on [a, b] and corresponding control polygon points (d i ) n, the function B α defined on [a, b] valued in IR d by B α (x) d α i B n i (x), x [a, b] where ( α B n i )n is the rational Bernstein basis of α index and degree n as defined by the equation 2 Remark 2.3 Observe that ( B n i )n is the classical polynomial Bernstein basis defined in 1. Illustration 2.1 Before any deep analysis, we show throughout the figures 1, 2, 3, 4 and 5 the qualitative effect of the index α on the behavior of the new Bernstein basis functions. Figure 1 Basis function α B 1 i for α { 1, 2, 5, } A flash exploration of these figures shows that the parameter α has a notable effect on the functions of the Bernstein basis for any degree. We now refine this first reading by the check of the classical properties of Bernstein functions. 2.3 Properties of the new Bernstein basis Proposition 2.1 Let n IN and a, b IR such that a < b. Let α ], 0[ ]1, + [, f α H([a, b]) and ( α B n i )n the rational Bernstein basis of α index and degree n defined by the equation 2. The following properties hold : 1. The positivity : For all x [a, b], α B n i (x) 0 2. The partition of unity : For all x [a, b], α B n i (x) 1 5

6 Figure 2 Basis function α B 2 i for α { 1, 2, 5, } Figure 3 Basis function α B 3 i for α { 1, 2, 5, } 3. The symmetry : For all x [a, b], for all i 0,..., n, α B n i (a + b x) 1 α B n n i (x) 4. The recursion : For all x [a, b], for all i 0,..., n + 1, α B n+1 i (x) w(x) α B n i 1(x) + (1 w(x)) α B n i (x) where w(x) f α (x). Soit α ], 0[ ]1, + [ et f α H([a, b]). 1. (The positivity) By remark 2.2, for all x [a, b] w(x) f α (x) [0, 1]. Then 1 w(x) [0, 1] so that α B n i (x) C i nw i (x)(1 w(x)) n i 0 i 0,..., n 6

7 Figure 4 Basis function α B 4 i for α { 1, 2, 5, } Figure 5 Basis function α B 5 i for α { 1, 2, 5, } 2. (The partition of unity) Using the binomial formula of Newton s, we have α B n i (x) Cnw i i (x)(1 w(x)) n i (w(x) + (1 w(x))) n 1 3. (The symmetry) Let i 0,..., n and x [a, b]. We have y a + b x [a, b] and α(b x) w(y) f α (a + b x) x + αb + (1 α)a (1 α)(x a) 1 w(y) x αb (1 α)a f 1 α (x) 7

8 Then 4. (The recursion) α B n+1 i+1 α B n n i(a + b x) α B n n i(y) Cn n i w n i (y)(1 w(y)) i Cn n i (1 f 1 α (x)) n i (f 1 α (x)) i Cn(f i 1 α (x)) i (1 f 1 α (x)) n i 1 α B n i (x) (x) Ci+1 n+1 wi+1 (x)(1 w(x)) n i ( Cn i + Cn i+1 ) w i+1 (x)(1 w(x)) n i C i nw i+1 (x)(1 w(x)) n i + C i+1 n w i+1 (x)(1 w(x)) n i w(x)cnw i i (x)(1 w(x)) n i + (1 w(x))cn i+1 w(x) α B n i (x) + (1 w(x)) α B n i+1(x) Remark 2.4 For all n IN, a, b IR such that a < b and α ], 0[ ]1, + [. ( α B n i )n, the rational Bernstein basis of α index and degree n on the parameter space [a, b]. satisfies : α B n 0 (a) α B n n(b) 1 α B n i (a) 0 i 1,..., n α B n (3) i (b) 0 i 0,..., n 1 α B n i (x) > 0 i 0,..., n, x ]a, b[ Proposition 2.2 Let n IN and a, b IR such that a < b. Let α ], 0[ ]1, + [. and f α H([a, b]). Consider the rational Bernstein basis ( α B n i )n and (α B n+1 i of degrees n and n + 1 with parameters in [a, b]. For all x [a, b] and w(x) f α (x), we have : 1. (1 w(x)) α B n i (x) n + 1 i n + 1 α B n+1 i, i 0,..., n 2. w(x) α B n i (x) i + 1 α B n+1 i+1, i 0,..., n n + 1 By a direct computation. ) n+1 w i+1 (x)(1 w(x)) n i 1 of α index, Proposition 2.3 Let n IN and a, b IR such that a < b. Let α ], 0[ ]1, + [. and f α H([a, b]). The rational Bernstein basis ( α B n i )n of α index and degree n on the parameter space [a, b], is formed of rational functions of degree (n, n) and infinitely differentiable on [a, b]. Moreover, we have : 8

9 1. First order derivative : For all x [a, b] and i 0,..., n we have n dw (1 w(x))n 1 i 0 d α B n i (x) (i nw(x)) dw C i nw i 1 (x)(1 w(x)) n i 1 1 i n 1 (4) with w(x) f α (x) d 2 2 α B n i (x) n dw wn 1 (x) α(x a) x + (α 1)b αa i n dw α(α 1)(b a) and (x) (x + (α 1)b αa) 2 2. Seconde order DerivBase : For all x [a, b] and i 0,..., n [ ( ) ] 2 n(1 w(x)) n 2 d2 w dw (1 w(x)) + (n 1) 2 [ n(1 w(x)) n 3 d 2 w (n 1) ( dw (1 w(x))(1 nw(x)) 2 ) 2 (2 nw(x))] C i nw i 2 (x)(1 w(x)) n i 2 [ (i nw(x))w(x)(1 w(x)) d2 w 2 + {(n 1)(nw(x) 2i)w(x) + i(i 1)} ( ) ] 2 dw i 0 i 1 2 i n 2 and d 2 2 α B n i (x) [ d nw n 3 2 w (x) w(x)(n 1 nw(x)) 2 ( ) 2 dw +(n 1) (n 2 nw(x))] nw n 2 (x) [ d 2 w w(x) + (n 1) 2 ( ) ] 2 dw i n 1 i n where d2 w 2α(α 1)(b a) 2 (x + (α 1)b αa) 3 α B n i is a polynomial of f α. Since f α C ([a, b]), it is the same for α B n i. We complete the proof by simple computation. Remark 2.5 For all n IN and a, b IR such that a < b and α ], 0[ ]1, + [, using the relation 4, we observe that the derivatives of 9

10 elements of the rational Bernstein basis of α index and degree n on the parameter space [a, b], ( α B n i )n satisty the following relations : d α B n α 0 (a) n (α 1)(b a) and d α B n α 1 (a) n (α 1)(b a) d α B n n 1(b) n α 1 α(b a) and d α B n n(b) n α 1 (5) α(b a) d α B n i (a) 0 i 2,..., n and d α B n i (b) 0 i 0,..., n 2 Proposition 2.4 Let n IN and a, b IR such that a < b and α ], 0[ ]1, + [. Let ( α B n i )n be the rational Bernstein basis of α index and degree n on the parameter space [a, b], 1. Uniqueness of the maximun : For i 0,..., n, α B n i has a unique maximun in x i [a, b], such that w(x i ) i. The value of this maximun n is independant of α. More precisely, we have x i a + i(α 1) nα i (b a) and α B n i (x i ) Cn i i i (n i) n i n n 2. Maximun symmetrical property : For i 0,..., n, α B n i, α B n n i and 1 α B n i have the same maximun. 1. Existence and uniqueness of the maximum α B n 0 is decreasing strictly on [a, b], then it has a maximun in a. α B n n is increasing strictly on [a, b], then it has a maximun in b. d For i 1,..., n 1 the sign of α B n i and i nw(x) are the same on [a, b]. This is the sign same of i nf α (x). Since f α is increasing strictly on [a, b] then there exist a unique x i [a, b] such that f α (x i ) i [0, 1]. We have n { i nw(x) > 0 x < xi i nw(x) < 0 x > x i Thus α B n i has a maximun in x i satisfying w(x i ) i n and α B n i (x i ) is independant of α. and it can be obtained by simple computation 2. Maximun symmetrical property : By simple computation, we have max α B n i (x) max α B n n i(x) max 1 α B n i (x) x [a, b] x [a, b] x [a, b] i 0,..., n 10

11 Proposition 2.5 Let n IN and a, b IR such that a < b. Let α ], 0[ ]1, + [. and f α H([a, b]). The rational Bernstein basis of α index and degree n on [a, b], ( α B n i )n is a linear independent family. We proceed by induction on n. Let x [a, b] and w(x) f α (x) For n 1, if λ α i B n i 0 then for all x [a, b] we have λ 0 (1 w(x)) + λ 1 w(x) 0. In particular : { λ0 λ 0 (1 w(a)) + λ 1 w(a) 0 λ 1 λ 0 (1 w(b)) + λ 1 w(b) 0 Therefore (α ) B 1 1 i is a linear independent family Assumes that the property holds up to an order n IN, and show that ( α B n+1 ) n+1 i is a linear independent family. n+1 If λ α i B n+1 i 0 then for all x ]a, b[ we have 0 n+1 λ α i B n+1 i (x) n+1 ( λ i w(x) α B n i 1(x) + (1 w(x)) α B n i (x) ) (w(x)λ i+1 + (1 w(x))λ i ) α B n i (x) Using the assumption : ( α B n i )n is a linear independent system we have Otherwise w(x)λ i+1 + (1 w(x))λ i 0, i 0,..., n, x ]a, b[ (6) n+1 λ n+1 λ α i B n+1 i (b) 0 (7) The linear system from the equation 6 completed by equation 7 is inversible triangular upper since the terms of the diagonal are nonzero. We deduce that λ i 0, i 0,..., n + 1. Then we can conclude that (α B n+1 ) n+1 i is a linear independent system. Remark 2.6 Since ( α B n i )n is a linear independent system then there is a basis of an approximation space of continuous real functions. 11

12 3 Properties of the new class of Bézier curves Let n IN and a, b IR such that a < b. Let α ], 0[ ]1, + [. and f α H([a, b]). Let ( α B n i )n be the rational Bernstein basis of α index and degree n on [a, b]. Consider the rational Bézier curve B α of α index and degree n with control polygon points (d i ) n IRd defined for all x [a, b] by B α (x) d α i B n i (x) 3.1 Geometric properties The curves of this new class check the properties of the classical Bézier curves. The proposition below lists the most important of these properties. Proposition 3.1 Let B α the rational Bézier curve of α index and degree n with control polygon points (d i ) n on a parameter space [a, b]. The following properties hold : 1. Extremities interpolation properties : The Bézier curve B α interpol the extremities points of its control polygon; it means that B α (a) d 0 and B α (b) d n 2. Extremities tangents properties : The Bézier curve B α is tangent to its control polygon to the extremities. More precisely, we have db α (a) n α (α 1)(b a) (d 1 d 0 ) db α (α 1) (b) n α(b a) (d n d n 1 ) 3. Convex hull property : B α is in the convex hull of its control points (d i ) n. In the other way, for all x [a, b], there exists (λ i) n IR + such that B α (x) λ i d i with λ i 1 4. Invariance property of affine transformation : For all affine transformation T in IR d, we have T (B α (x)) T (d i ) α B n i (x) Consider the rational Bézier curve B α of α index and degree n with control polygon points (d i ) n on the parameter space [a, b]. 12

13 1. Using the remark (3), we have B α (a) d α i B n i (a) d 0 α B n 0 (a) d 0 and B α (b) d α i B n i (b) d n α B n n(b) d n 2. Using the remark (5), we have and d B α(a) d B α(b) 3. For all x [a, b], we have d d α i B n i (a) α B n d 0 (a) + d 1 d d 0 (d 1 d 0 ) d d d α i B n i (b) α B n 1 (a) α B n 1 (a) d d α n 1 B n d n 1(b) + d α n B n n(b) (d n d n 1 ) d α B n n(b) B α (x) d α i B n i (x) λ i d i where λ i α B n i (x) IR + i Using a unity partition property we obtain λ i α B n i (x) 1. Then B α (x) is in the convex hull of its control polygon points. (d i ) n 4. Let T be an affine transformation in IR d. There is a square matrix M of order d and a point C IR d such that for all X IR d, we have 13

14 T (X) M X + C. Let x [a, b]. Since B α (x) IR d we have ( n ) T (B α (x)) T d α i B n i (x) ( n ) M d α i B n i (x) + C ( n ) M(d α i B n i (x)) + α B n i (x) C This proves the property. (Md α i B n i (x)) + (C α B n i (x)) (Md i + C) α B n i (x) T (d i ) α B n i (x) Proposition 3.2 (Degree elevation algorithm) Given the rational Bézier curve B α of α index and degree n with control polygon points (d i ) n IRd on the parameter space [a, b], then there exists a rational Bézier curve C α of α index ( ) n+1 and degree n + 1 with control polygon points ˆdi IR d on the parameter space [a, b] identical to B α. More precisely we have : B α (x) ˆd 0 d 0 ˆd i i n + 1 d i 1 + ˆd n+1 d n n+1 ˆd α i B n+1 i (x) with ( 1 i ) d i n i n For all α ], 0[ ]1, + [ and f α H([a, b]), putting w(x) f α (x) for all x [a, b]. Using the proposition 2.2, we have : α B n i (x) (1 w(x)) α B n i (x) + w(x) α B n i (x) i 0,..., n n + 1 i α B n+1 i (x) + i + 1 α B n+1 i+1 (x) i 0,..., n n + 1 n

15 Then B α (x) d α i B n i (x) d i [ n + 1 i n + 1 d i n + 1 i n + 1 d i n + 1 i n + 1 d 0 α B n+1 0 (x) + This proves the result. α B n+1 i (x) + i + 1 n + 1 α B n+1 i (x) + α B n+1 n+1 d i 1 i (x) + i1 [ n + 1 i d i + n + 1 i1 ] α B n+1 i+1 (x) i + 1 d α i B n+1 i+1 n + 1 (x) i n + 1 i n + 1 d i 1 α B n+1 i (x) ] α B n+1 n+1 (x) i (x) + d n α B n+1 Illustration 3.1 For illustration we show here the Bézier curves B α of degree 3 for α { 1, 2, 5, }. The control polygons of the respective curves are as follow : Π a {(0, 2), (3.5, 0), (3.5, 4), (0, 0)} Π b {(0, 1), (3.5, 0), (3.5, 4), (0, 1)} Π c {(0, 1), (4.5, 4), (5.5, 0), (3.5, 1)} Π d {(0, 1), (4, 0.5), (2.5, 3), (6, 3)} Π e {(0, 1.5), (4, 0.5), (5, 4), (3, 2)} Π f {(0, 3.5), (4, 0.5), (5, 4), (0, 0)} Π g {(0, 3.5), (4, 0.5), (4.5, 2.5), (0, 0)} Π h {(0, 0), (2, 2.5), (4.5, 3), (6.5, 1.5)} Π i {(0, 3.5), (5, 1), (5, 1), (0, 0)} Figure 6 The curves B 1 15

16 Figure 7 The curves B 2 Figure 8 The curves B 5 A comparative analysis of figures 6, 7, 8, and 9 suggest that the Bézier curves are independent in index α, but each curve is function of its control polygon. 3.2 Algorithms for computing the Bézier curve These algorithms show that it is possible to calculate a point of the Bézier curve or all without the need to build the basis of Bernstein. The most fondemental is decasteljau algorithm which can be formulate by the following proposition : Proposition 3.3 (decasteljau algorithm) For all r 0,..., n and x 16

17 Figure 9 The curves B [a, b] we have : with d 0 i (x) d i n r B α (x) d r i (x) α B n r i (x) i 0,..., n d r+1 i (x) w(x)d r i+1(x) + (1 w(x))d r i (x) r 0,..., n 1 i 0,..., n r 1 where w(x) f α (x) Moreover we have B α (x) d n 0 (x) As in [1], we proceed by induction to prove this algorithm. Let x [a, b] and w(x) f α (x). Since α B n i (x) w(x) α B n 1 i 1 (x) + (1 w(x))α B n 1 i (x) and α B n 1(x) α B n n+1(x) 0 then B α (x) d α i B n i (x) n 1 d i [ w(x) α B n 1 i 1 (x) + (1 w(x))α B n 1 i (x) ] n d i w(x) α B n 1 i 1 (x) + d i (1 w(x)) α B n 1 i (x) [w(x)d i+1 + (1 w(x))d i ] α B n 1 i (x) n 1 d 1 i (x) α B n 1 i (x) with d 1 i (x) (1 w(x))d 0 i (x) + w(x)d 0 i+1(x) where d 0 i (x) d i i 17

18 n r Now we will show that for all 1 r n we have B α (x) d r i α B n r i (x) with d r i (x) (1 w(x))d r 1 i (x) + w(x)d r 1 i+1 (x) n r Assume that for 1 r < n, we have B α (x) d r i (x) (1 w(x))d r 1 i (x) + w(x)d r 1 (x) Then i+1 d r i α B n r i (x) with B α (x) n r d r i α B n r i (x) n r d r i n r n r 1 n r 1 [ w(x) α B n r 1 i 1 (x) + (1 w(x)) α B n r 1 i (x) ] n r d r i w(x) α B n r 1 i 1 (x) + d r i+1w(x) α B n r 1 i (x) + d r i (1 w(x)) α B n r 1 i (x) n r 1 [ w(x)d r i+1 + (1 w(x))d r i ] α B n r 1 i (x) d r i (1 w(x)) α B n r 1 i (x) n r 1 d r+1 i α B n r 1 i (x) with d r+1 i (x) (1 w(x))d r i (x) + w(x)d r i+1(x) and we deduce the result. Proposition 3.4 (subdivision algorithm) Let c ]a, b[. The point B α (c) d n 0 (c) computed by the relation d 0 i (c) d i i 0,..., n d r+1 i (c) w(c)d r i+1(c) + (1 w(c))d r i (c) r 0,..., n 1 i 0,..., n r 1 where w(x) f α (x) divides the curve B α in two rational Bézier curves of α index and degree n on the parameter space [a, b] whose the control polygon points are respectively ( d i 0(c) ) n and ( d n i i (c) ) n The proof of this proposition uses the following three lemmas : ) Lemma 3.1 The points (d jk (c) defined by the algorithm of the proposition 3.4, satisty for all 0 k j n, the relation d j k (c) j d α i+k B j i (c) Let c ]a, b[ and w f α (c). From the proposition 3.4, for all 0 k j n, 18

19 we have d j k (c) (1 w)dj 1 k (c) + wd j 1 k+1 (c). we proceed by induction to prove r that for all 1 r j, d j k (c) d j r k+i (c)α B r i (c) and we deduce the result for r j. For all j 1 we have d j k (c) (1 w)dj 1 k (c) + wd j 1 k+1 (c) α B 1 0(c)d j 1 (c) + α B 1 1(c)d j 1 1 k α B r1 i (c)d j 1 k+i (c) Assume that for all 1 r < j, we have d j k (c) the proposition 2.2, we have d j k (c) r d j r k+i (c)α B r i (c) r [ (1 w)d j r 1 k+i (c) + wd j r 1 r d j r 1 k+i (c) [(1 w) α B r i (c)] + r r d j r 1 k+i (c) r+1 d j r 1 d j r 1 k+i (c) This completes the proof. [ r + 1 i r + 1 [ r + 1 i r + 1 k+i (c) α B r+1 i (c) r k+i+1 (c) ] α B r i (c) r α B r+1 i (c) ] α B r+1 i (c) ] + k+1 (c) d j r k+i (c)α B r i (c) then using d j r 1 k+i+1 (c) [wα B r i (c)] r r+1 + i1 [ d j r 1 i + 1 k+i+1 (c) r + 1 [ d j r 1 i k+i (c) r + 1 ] α B r+1 i+1 (c) ] α B r+1 i (c) Lemma 3.2 Let α ], 0[ ]1, [, and a, b IR with a < b. Let c ]a, b[ and f α H([a, b]). There exists a bijective mapping u from [a, b] to [a, c] such that f α u f α (c)f α Moreover, for all n IN and i IN with i n we have α B n i (u(t)) α B j i (c)α B n j (t), t [a, b] j0 Step 1 First of all let us prove the existence of u For c ]a, b[, we have f α (c) ]0, 1[. For all t [a, b], we have f α (t) [0, 1]. Since f α is increasing strictly then w f α (c)f α (t) [0, f α (c)] f α ([a, c]) [0, 1] 19

20 Using the fact that f α is a bijection we have an unique u(t) [a, c] such that f α (u(t)) w f α (c)f α (t). This implies the mapping t [a, b] u(t) fα 1 (f α (c)f α (t)) [a, c] Let x, y [a, c] such that x < y, we have f α (x) < f α (y). Then f α (c)f α (x) < f α (c)f α (y) and u(x) fα 1 (f α (c)f α (x)) < fα 1 (f α (c)f α (y)) u(y) u is increasing strictly. Then u is an increasing injection. Since f α and f 1 α u(a) f 1 α u(b) f 1 α (f α (c)f α (a)) f 1 α (f α (c)f α (b)) f 1 α (0) a (f α (c)) c are continuous then u is continuous and we have u([a, b]) [u(a), u(b)] [a, c] Therefore u is a bijection from [a, b] to [a, c] and satisfies f α u f α (c)f α. Step 2 Let t [a, b], w(t) f α (t) and w(c) f α (c) we have We deduce w f α u(t) w(c)w(t) 1 w 1 w(c)w(t) (1 w(t)) + w(t) (1 w(c)) (1 w) n i [(1 w(t)) + w(t) (1 w(c))] n i n i C j n i (1 w(t))j [w(t) (1 w(c))] n i j j0 w i (1 w) n i n i C j n i [w(t)w(c)]i (1 w(t)) j [w(t) (1 w(c))] n i j j0 n i C j n i j0 [w n j (t)(1 w(t)) j][ w i (c) (1 w(c)) n i j] α B n i (u(t)) Ci n w i (1 w) n i n i CnC i j n i [w n j (t)(1 w(t)) j][ w i (c) (1 w(c)) n i j] j0 n i CnC i j α B n n j (t) α B n i (c) n i (1 w(c)) j j0 n i C j n i j0 Cn n j C n j n C i n α B n n j(t) α B n i (c) (1 w(c)) j By an iterative use of the proposition 2.2 we have j 1 ( α B n i (c) (1 w(c)) j n l n i l l0 20 ) α B n j i (c) Cj n C j n i α B n j i (c)

21 We deduce that n i α B n i (u(t)) α B n n j(t) α B n j i (c) j0 α B n j (t) α B j i (c) ji α B n j (t) α B j i (c) Since for all i > j we have α B j i (c) 0, the expected result follows. j0 Lemma 3.3 Let α ], 0[ ]1, [, and a, b IR and a < b. Let c ]a, b[ and f α H([a, b]). There exists a bijective mapping v from [a, b] to [c, b] such that for all t [a, b] f α v(t) 1 (1 f α (c))(1 f α (t)) Moreover, for all n IN and i IN with i n α B n i (v(t)) j0 α B n j i j (c)α B n j (t), t [a, b] Step 1 First of all we prove the existence of v Let c ]a, b[. We have f α (c) ]0, 1[ since 1 f α (c) ]0, 1[. By same way, for all t [a, b], we have f α (t) [0, 1] and 1 f α (t) [0, 1]. Since f α is increasing strictly we deduce that, for all t [a, b], we have an unique w(t) 1 (1 f α (c))(1 f α (t)) [f α (c), 1] f α ([c, b]) [0, 1] Using the fact that f α is a bijection we have an unique v(t) [a, c] such that f α (v(t)) w(t). This implies a mapping t [a, b] v(t) f 1 α [1 (1 f α (c))(1 f α (t))] [c, b] Let x, y [c, b] such that x < y, we have (1 f α (c))(1 f α (x)) > (1 f α (c))(1 f α (y)). Then v(x) fα 1 [1 (1 f α (c))(1 f α (x))] < fα 1 [1 (1 f α (c))(1 f α (y))] v(y) v is increasing strictly. v is an increasing injection from [a, b] to [v(a), v(b)] [c, b] since v is continuous. Then v is a bijection from [a, b] to [c, b] and satisfies, for all t [a, b] f α v(t) 1 (1 f α (c))(1 f α (t)) 21

22 Step 2 Let t [a, b], w(t) f α (t) and w(c) f α (c) we have Then we have w f α v(t) 1 (1 w(c)) (1 w(t)) w(t) + w(c) (1 w(t)) 1 w (1 w(t)) (1 w(c)) ( w) i [w(t) + w(c) (1 w(t))] i i C j i (w(t))j [w(c) (1 w(t))] i j j0 w i (1 w) n i i C j i j0 [(w(t)) j (1 w(t)) n j][ (w(c)) i j (1 w(c)) n i] α B n i (u(t)) Ci n w i (1 w) n i i CnC i j i [(w(t)) j (1 w(t)) n j][ (w(c)) i j (1 w(c)) n i] j0 i j0 i C j i C j i j0 i C j i j0 Cn j [(w(t)) j (1 w(t)) n j][ C i n(w(c)) i j (1 w(c)) n i] α B n j (t) α B n i (c) (w(c)) j C j n α B n j (t) α B n i (c) (w(c)) j An iterative use of the proposition 2.2 implies j 1 α B n i (c) (w(c)) j We deduce that l0 ( ) n l i l α B n i (v(t)) i j0 ji α B n j i because that, for all i < j we have α B i j n j (c) 0 of the proposition 3.4 (c) Cj n C j i α B n j (t) α B n j i j (c) α B n j i j (c)α B n j (t) α B n j i (c) 22

23 Let B α and ˆB α be the restrictions of B α on the respective intervals [a, c] [a, b] and [c, b] [a, b] mapping the parameter space [a, b]. For all t [a, b], using the lemma 3.2 we have u(t) [a, c] and B α (t) B α (u(t)) d α i B n i (u(t)) B j i (c)α B n j (t) d i j0 ( ) d α i B j i (c) α B n j (t) j0 [ n ] d α i B j i (c) α B n j (t) j0 d j 0 (c)α B n j (t) j0 That is the expected result by using the lemma 3.1 With the lemma 3.3, for all t [a, b] we have using the lemma 3.1. ˆB α (t) B α (v(t)) d α i B n i (v(t)) d i B n j i j (c)α B n j (t) j0 d α i B n j i j (c)α B n j (t) j0 ( n ) d α i B n j i j (c)α B n j (t) j0 ( n d α i B n j i j (c) B n j (t) j0 d α i B n j α B n j (t) j0 ij ( n j j0 j0 i j (c) d α i+j B n j i (c) d n j j α B n j (t) ) α B n j (t) 23

24 Corollary 3.1 (Algorithm of Bézier curve construction ) Let c a + b 2. The point B α (c) d n 0 computed by the relation d 0 i d i i 0,..., n d r+1 i α 2α 1 dr i+1 + α 1 2α 1 dr i r 0,..., n 1 i 0,..., n r 1 subdivides the rational Bézier curve B α in two rational Bézier curves of α index and degree n, on the parameter space [a, b] with the respective control polygon points : ( d i ) n 0 and ( d n i i ) n A direct application of the proposition 3.4. Illustration 3.2 The figures 10, 11, 12 and 13 point out some alternatives of the subdivision algorithm iterate on 4 levels in the construction of the Bézier curve B α with control polygon Π {(0, 3.5), (4, 0.5), (4.5, 2.5), (0, 0)} with α { 1, 2, 5, } Figure 10 Bézier curve B 1 and control sub-polygons on levels up to 4 From the analysis of the figures 10 and 11 we can observe that the chronological repartition of the control sub-polygons points of the Bézier curves B 1 et B 2, points out the symmetrical effect of the indexes α and 1 α. In the Bézier curve B 1 the points concentration converge to the endpoint of parameter 0, in the Bézier curve B 2 the points concentration converge to the endpoint of parameter 1. The points equirepartition in the figure 13 confirms the self symmetry shown in the standard case which corresponds to α. Remark 3.1 In conducting evidence geometric properties Bézier curves discussed above, the nature of the functions homographic f α H([a, b]) was not 24

25 Figure 11 Bézier curve B 2 and control sub-polygons on levels up to 4 Figure 12 Bézier curve B 5 and control sub-polygons on levels up to 4 exploited. We only used the fact that are an increasing bijection of [a, b] into [0, 1]. The following proposition shows that the curves B α are completely defined by their points of control. Which reinforces this observation. In this proof we only used the fact that f α is a diffeomorphism of the class C 2. Proposition 3.5 Let n, d IN and we consider n+1 points (d i ) n IRd. Let α, β ], 0[ ]1, [ and a, b, a 1, b 1 IR such that a < b and a 1 < b 1. The rational Bézier curve B α of α index and degree n with control polygon points (d i ) n on the parameter space [a, b] is same to the rational Bézier curve B β of β index and degree n with control polygon points (d i ) n, the parameter space [a 1, b 1 ] 25

26 Figure 13 Bézier curve B and control sub-polygons on levels up to 4 Let M B α and f α H([a, b]), then there exists x [a, b] such that w f α (x) [0, 1] and M B α (x) d α i B n i (x) with α B n i (x) Cnw i i (1 w) n i. Since f β H([a 1, b 1 ]) is a bijection from [a 1, b 1 ] into [0, 1] then y f 1 β (w) [a 1, b 1 ] and β B n i (y) Cnw i i (1 w) n i α B n i (x). This implies M B α (x) d α i B n i (x) d β i B n i (y) B β (y) B β We conclude that M B α M B β In the same way we show that M B β M B α More precisely we have α B n i β B n i f 1 β f α and x [a, b] B α (x) B β (y) with y f 1 β f α (x) [a 1, b 1 ]. Otherwise one can observe that f H([a, b]) we have f, f 1 C ([a, b]). Then we have f 1 β f α C ([a, b]). For all x [a, b] we have db α (x) db β dy (y) dy d 2 ( ) 2 B α 2 (x) d2 B β dy dy 2 (y) + db β dy (y) d2 y 2 with y f 1 β f α (x) The curves B α and B β have the same tangente at the common point B α (x) for all x [a, b] Therefore db α (x) d2 B α 2 (x) db ( ) 3 β dy (y) d2 B β dy dy 2 (y) 26

27 and db α (x) d2 B α 2 (x) db β dy (y) d2 B β dy 2 (y) dy We deduce that κ α (x) and κ β (y) the respective curvatures of B α and B β at the common point B α (x) B β (y) satisty dbα (x) d2 B α (x) db β κ α (x) 2 dy (y) d2 B β dy (y) db α (x) 3 2 db β dy (y) 3 κ β (y) This complete the proof. 4 Conclusion We have an approximation basis of rational functions which unfortunately can not create the functions t t 1 t2 and t. Thus, this new family of 1 + t2 1 + t2 Bézier curves do not resolve the primary motivation of rational Bézier curves, which consists of generating planar conics exactly. This new class, however, gives another alternative construction of Bézier curves using algorithms as soon as accurate than the standard one with a large conservation of usual properties of Bernstein functions and Bézier curves. The analysis of the approximation properties of this new class of Bernstein functions can be of some interest. References [1] Duncan Marsh. Applied Geometry for Computer Graphics and CAD. ed. Springer Verlag, (2005). [2] L. Piegl, W. Tiller The NURBS Book. Ed. Springer Verlag, (1997) [3] G. E. Randriambelosoa On a family of rational polynomials for Bezier curves and surfaces. Communication privée à l Université d Antanarivo, Madagascar (2012) [4] D. F. Rogers An Introduction to NURBS with historical perspective. Ed. Morgan Kaufmann publishers, (2001) [5] E. Lengyel Mathematics for 3D game programming and Computer Graphics. Ed. Carles River Media Inc., (2003) Appendix 3 Rational Bernstein basis functions of degree 2 and derivatives : 27

28 (α 1) 2 (b t) 2 if i 0 (α b b α a+t) 2 α B 2 2 (α 1) α (a t) (b t) i (t) if i 1 (α b b α a+t) 2 α 2 (a t) 2 if i 2 (α b b α a+t) 2 d α B 2 i (t) dt 2 (α 1)2 α (b t) (b a) (α b b α a+t) 3 if i 0 2 (α 1) α (b a) (α b b+α a 2 α t+t) (α b b α a+t) 3 if i 1 2 (α 1) α2 (a t) (b a) (α b b α a+t) 3 if i 2 Rational Bernstein basis functions of degree 3 and derivatives : (α 1) 3 (b t) 3 if i 0 (α b b α a+t) 3 3 (α 1)2 α (a t) (b t) 2 if i 1 α B 3 (α b b α a+t) i (t) 3 3 (α 1) α 2 (a t) 2 (b t) if i 2 (α b b α a+t) 3 α3 (a t) 3 if i 3 (α b b α a+t) 3 d α B 3 i (t) dt 3 (α 1)3 α (b t) 2 (b a) (α b b α a+t) 4 if i 0 3 (α 1) 2 α (b t) (b a) (α b b+2 α a 3 α t+t) (α b b α a+t) 4 if i 1 3 (α 1) α2 (a t) (b a) (2 α b 2 b+α a 3 α t+2 t) (α b b α a+t) 4 if i 2 3 (α 1) α 3 (a t) 2 (b a) (α b b α a+t) 4 if i 3 28

Computer Aided Design. B-Splines

Computer Aided Design. B-Splines 1 Three useful references : R. Bartels, J.C. Beatty, B. A. Barsky, An introduction to Splines for use in Computer Graphics and Geometric Modeling, Morgan Kaufmann Publications,1987 JC.Léon, Modélisation

More information

Interpolation and polynomial approximation Interpolation

Interpolation and polynomial approximation Interpolation Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier

More information

The Essentials of CAGD

The Essentials of CAGD The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000

More information

Curves, Surfaces and Segments, Patches

Curves, Surfaces and Segments, Patches Curves, Surfaces and Segments, atches The University of Texas at Austin Conics: Curves and Quadrics: Surfaces Implicit form arametric form Rational Bézier Forms and Join Continuity Recursive Subdivision

More information

1 f(u)b n i (u)du, (1.1)

1 f(u)b n i (u)du, (1.1) AMRX Applied Mathematics Research express 25, No. 4 On a Modified Durrmeyer-Bernstein Operator and Applications Germain E. Randriambelosoa 1 Introduction Durrmeyer [6] has introduced a Bernstein-type operator

More information

M2R IVR, October 12th Mathematical tools 1 - Session 2

M2R IVR, October 12th Mathematical tools 1 - Session 2 Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline

More information

Nonlinear Means in Geometric Modeling

Nonlinear Means in Geometric Modeling Nonlinear Means in Geometric Modeling Michael S. Floater SINTEF P. O. Box 124 Blindern, 0314 Oslo, Norway E-mail: Michael.Floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research

More information

Introduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points

Introduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular

More information

ANNALES DE LA FACULTÉ DES SCIENCES DE TOULOUSE

ANNALES DE LA FACULTÉ DES SCIENCES DE TOULOUSE ANNALES DE LA FACULTÉ DES SCIENCES DE TOULOUSE ALEX BIJLSMA A note on elliptic functions approximation by algebraic numbers of bounded degree Annales de la faculté des sciences de Toulouse 5 e série, tome

More information

On-Line Geometric Modeling Notes

On-Line Geometric Modeling Notes On-Line Geometric Modeling Notes CUBIC BÉZIER CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview The Bézier curve representation

More information

Arsène Pérard-Gayot (Slides by Piotr Danilewski)

Arsène Pérard-Gayot (Slides by Piotr Danilewski) Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =

More information

Generalized Ehrhart polynomials

Generalized Ehrhart polynomials FPSAC 2010, San Francisco, USA DMTCS proc. (subm.), by the authors, 1 8 Generalized Ehrhart polynomials Sheng Chen 1 and Nan Li 2 and Steven V Sam 2 1 Department of Mathematics, Harbin Institute of Technology,

More information

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

More information

1. A Little Set Theory

1. A Little Set Theory . A Little Set Theory I see it, but I don t believe it. Cantor to Dedekind 29 June 877 Functions are the single most important idea pervading modern mathematics. We will assume the informal definition

More information

Matrix Methods for the Bernstein Form and Their Application in Global Optimization

Matrix Methods for the Bernstein Form and Their Application in Global Optimization Matrix Methods for the Bernstein Form and Their Application in Global Optimization June, 10 Jihad Titi Jürgen Garloff University of Konstanz Department of Mathematics and Statistics and University of Applied

More information

Approximation of Circular Arcs by Parametric Polynomials

Approximation of Circular Arcs by Parametric Polynomials Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier

CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually

More information

Bernstein polynomials of degree N are defined by

Bernstein polynomials of degree N are defined by SEC. 5.5 BÉZIER CURVES 309 5.5 Bézier Curves Pierre Bézier at Renault and Paul de Casteljau at Citroën independently developed the Bézier curve for CAD/CAM operations, in the 1970s. These parametrically

More information

Numerical Ranges and Dilations. Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement

Numerical Ranges and Dilations. Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement Numerical Ranges and Dilations Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his retirement Man-Duen Choi Department of Mathematics, University of Toronto, Toronto, Ontario, Canada M5S 3G3.

More information

Novel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial blossoming

Novel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial blossoming See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/283943635 Novel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial

More information

A STATISTICAL STUDY OF THE KOSTKA-FOULKES POLYNOMIALS Guo-Niu HAN

A STATISTICAL STUDY OF THE KOSTKA-FOULKES POLYNOMIALS Guo-Niu HAN Advances in Applied Mathematics, 14(1993), 247 266 A STATISTICAL STUDY OF THE KOSTKA-FOULKES POLYNOMIALS Guo-Niu HAN Département de mathématique Université Louis Pasteur 7, rue René-Descartes, F-67084

More information

Subdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves

Subdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 Subdivision Matrices Iterated Function Systems for Parametric Interval Bezier Curves O. Ismail, Senior Member,

More information

Counting Matrices Over a Finite Field With All Eigenvalues in the Field

Counting Matrices Over a Finite Field With All Eigenvalues in the Field Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu

More information

Pythagorean-hodograph curves

Pythagorean-hodograph curves 1 / 24 Pythagorean-hodograph curves V. Vitrih Raziskovalni matematični seminar 20. 2. 2012 2 / 24 1 2 3 4 5 3 / 24 Let r : [a, b] R 2 be a planar polynomial parametric curve ( ) x(t) r(t) =, y(t) where

More information

Chapter 1 Numerical approximation of data : interpolation, least squares method

Chapter 1 Numerical approximation of data : interpolation, least squares method Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated

More information

Week 9-10: Recurrence Relations and Generating Functions

Week 9-10: Recurrence Relations and Generating Functions Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably

More information

Visualizing Bezier s curves: some applications of Dynamic System Geogebra

Visualizing Bezier s curves: some applications of Dynamic System Geogebra Visualizing Bezier s curves: some applications of Dynamic System Geogebra Francisco Regis Vieira Alves Instituto Federal de Educação, Ciência e Tecnologia do Estado do Ceará IFCE. Brazil fregis@ifce.edu.br

More information

Sydney University Mathematical Society Problems Competition Solutions.

Sydney University Mathematical Society Problems Competition Solutions. Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed

More information

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016

Computergrafik. Matthias Zwicker Universität Bern Herbst 2016 Computergrafik Matthias Zwicker Universität Bern Herbst 2016 2 Today Curves Introduction Polynomial curves Bézier curves Drawing Bézier curves Piecewise curves Modeling Creating 3D objects How to construct

More information

CHAPTER 3 Further properties of splines and B-splines

CHAPTER 3 Further properties of splines and B-splines CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions

More information

COURSE Iterative methods for solving linear systems

COURSE Iterative methods for solving linear systems COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme

More information

Solutions Final Exam May. 14, 2014

Solutions Final Exam May. 14, 2014 Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10

More information

LINEAR FLOW IN POROUS MEDIA WITH DOUBLE PERIODICITY

LINEAR FLOW IN POROUS MEDIA WITH DOUBLE PERIODICITY PORTUGALIAE MATHEMATICA Vol. 56 Fasc. 2 1999 LINEAR FLOW IN POROUS MEDIA WITH DOUBLE PERIODICITY R. Bunoiu and J. Saint Jean Paulin Abstract: We study the classical steady Stokes equations with homogeneous

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

A matrix over a field F is a rectangular array of elements from F. The symbol

A matrix over a field F is a rectangular array of elements from F. The symbol Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted

More information

j=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A).

j=1 [We will show that the triangle inequality holds for each p-norm in Chapter 3 Section 6.] The 1-norm is A F = tr(a H A). Math 344 Lecture #19 3.5 Normed Linear Spaces Definition 3.5.1. A seminorm on a vector space V over F is a map : V R that for all x, y V and for all α F satisfies (i) x 0 (positivity), (ii) αx = α x (scale

More information

We consider the problem of finding a polynomial that interpolates a given set of values:

We consider the problem of finding a polynomial that interpolates a given set of values: Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.

More information

Spectrum of one dimensional p-laplacian Operator with indefinite weight

Spectrum of one dimensional p-laplacian Operator with indefinite weight Spectrum of one dimensional p-laplacian Operator with indefinite weight A. Anane, O. Chakrone and M. Moussa 2 Département de mathématiques, Faculté des Sciences, Université Mohamed I er, Oujda. Maroc.

More information

Jumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese

Jumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October

More information

A VARIANT OF HOPF LEMMA FOR SECOND ORDER DIFFERENTIAL INEQUALITIES

A VARIANT OF HOPF LEMMA FOR SECOND ORDER DIFFERENTIAL INEQUALITIES A VARIANT OF HOPF LEMMA FOR SECOND ORDER DIFFERENTIAL INEQUALITIES YIFEI PAN AND MEI WANG Abstract. We prove a sequence version of Hopf lemma, which is essentially equivalent to the classical version.

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

More information

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

More information

Solving Systems of Polynomial Equations

Solving Systems of Polynomial Equations Solving Systems of Polynomial Equations David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.

More information

1.1. The analytical denition. Denition. The Bernstein polynomials of degree n are dened analytically:

1.1. The analytical denition. Denition. The Bernstein polynomials of degree n are dened analytically: DEGREE REDUCTION OF BÉZIER CURVES DAVE MORGAN Abstract. This paper opens with a description of Bézier curves. Then, techniques for the degree reduction of Bézier curves, along with a discussion of error

More information

A note on singularity of a recently introduced family of Minkowski s question-mark functions

A note on singularity of a recently introduced family of Minkowski s question-mark functions Dynamical systems A note on singularity of a recently introduced family of Minkowski s question-mark functions Juan Fernández Sánchez a, Wolfgang Trutschnig b a Grupo de Investigación de Análisis Matemático,

More information

Solutions for Chapter 3

Solutions for Chapter 3 Solutions for Chapter Solutions for exercises in section 0 a X b x, y 6, and z 0 a Neither b Sew symmetric c Symmetric d Neither The zero matrix trivially satisfies all conditions, and it is the only possible

More information

arxiv: v1 [math.rt] 29 Oct 2014

arxiv: v1 [math.rt] 29 Oct 2014 Tensor product of Kraśkiewicz and Pragacz s modules arxiv:1410.7981v1 [math.rt] 29 Oct 2014 Masaki Watanabe Graduate School of Mathematical Sciences, The University of Tokyo, 3-8-1 Komaba Meguro-ku Tokyo

More information

On classifying Laguerre polynomials which have Galois group the alternating group

On classifying Laguerre polynomials which have Galois group the alternating group Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 On classifying Laguerre polynomials which have Galois group the alternating group par Pradipto Banerjee, Michael Filaseta, Carrie E. Finch

More information

CGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space

CGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space Curves CGT 511 Curves Bedřich Beneš, Ph.D. Purdue University Department of Computer Graphics Technology What is a curve? Mathematical ldefinition i i is a bit complex 1) The continuous o image of an interval

More information

1. Introduction Boundary estimates for the second derivatives of the solution to the Dirichlet problem for the Monge-Ampere equation

1. Introduction Boundary estimates for the second derivatives of the solution to the Dirichlet problem for the Monge-Ampere equation POINTWISE C 2,α ESTIMATES AT THE BOUNDARY FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We prove a localization property of boundary sections for solutions to the Monge-Ampere equation. As a consequence

More information

Chapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem

Chapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem Chapter 6 Approximation of algebraic numbers by rationals Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer Verlag 1980, Chap.II, 1,, Chap. IV, 1 L.J. Mordell,

More information

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0 Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =

More information

0.1 Rational Canonical Forms

0.1 Rational Canonical Forms We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best

More information

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can

More information

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 5. Nonlinear Equations Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T Heath Chapter 5 Nonlinear Equations Copyright c 2001 Reproduction permitted only for noncommercial, educational

More information

Monotone and oscillatory solutions of a rational difference equation containing quadratic terms

Monotone and oscillatory solutions of a rational difference equation containing quadratic terms Monotone and oscillatory solutions of a rational difference equation containing quadratic terms M. Dehghan, C.M. Kent, R. Mazrooei-Sebdani N.L. Ortiz, H. Sedaghat * Department of Mathematics, Virginia

More information

X. Numerical Methods

X. Numerical Methods X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced

More information

arxiv: v1 [math.nt] 5 Mar 2019

arxiv: v1 [math.nt] 5 Mar 2019 LOW DISCREPANCY SEQUENCES FAILING POISSONIAN PAIR CORRELATIONS arxiv:1903.0106v1 [math.nt] 5 Mar 019 Abstract. M. Levin defined a real number x that satisfies that the sequence of the fractional parts

More information

Absolute value equations

Absolute value equations Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West

More information

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u

More information

Existence of minimizers for the pure displacement problem in nonlinear elasticity

Existence of minimizers for the pure displacement problem in nonlinear elasticity Existence of minimizers for the pure displacement problem in nonlinear elasticity Cristinel Mardare Université Pierre et Marie Curie - Paris 6, Laboratoire Jacques-Louis Lions, Paris, F-75005 France Abstract

More information

ON POSITIVE, LINEAR AND QUADRATIC BOOLEAN FUNCTIONS

ON POSITIVE, LINEAR AND QUADRATIC BOOLEAN FUNCTIONS Kragujevac Journal of Mathematics Volume 36 Number 2 (2012), Pages 177 187. ON POSITIVE, LINEAR AND QUADRATIC BOOLEAN FUNCTIONS SERGIU RUDEANU Abstract. In [1], [2] it was proved that a function f : {0,

More information

arxiv: v1 [math.ac] 28 Feb 2018

arxiv: v1 [math.ac] 28 Feb 2018 arxiv:180210578v1 [mathac] 28 Feb 2018 Rings of constants of linear derivations on Fermat rings Marcelo Veloso e-mail: veloso@ufsjedubr Ivan Shestakov e-mail: shestak@imeuspbr Abstract In this paper we

More information

Existence and uniqueness: Picard s theorem

Existence and uniqueness: Picard s theorem Existence and uniqueness: Picard s theorem First-order equations Consider the equation y = f(x, y) (not necessarily linear). The equation dictates a value of y at each point (x, y), so one would expect

More information

Austin Mohr Math 730 Homework. f(x) = y for some x λ Λ

Austin Mohr Math 730 Homework. f(x) = y for some x λ Λ Austin Mohr Math 730 Homework In the following problems, let Λ be an indexing set and let A and B λ for λ Λ be arbitrary sets. Problem 1B1 ( ) Show A B λ = (A B λ ). λ Λ λ Λ Proof. ( ) x A B λ λ Λ x A

More information

An O(h 2n ) Hermite approximation for conic sections

An O(h 2n ) Hermite approximation for conic sections An O(h 2n ) Hermite approximation for conic sections Michael Floater SINTEF P.O. Box 124, Blindern 0314 Oslo, NORWAY November 1994, Revised March 1996 Abstract. Given a segment of a conic section in the

More information

A nonlinear equation is any equation of the form. f(x) = 0. A nonlinear equation can have any number of solutions (finite, countable, uncountable)

A nonlinear equation is any equation of the form. f(x) = 0. A nonlinear equation can have any number of solutions (finite, countable, uncountable) Nonlinear equations Definition A nonlinear equation is any equation of the form where f is a nonlinear function. Nonlinear equations x 2 + x + 1 = 0 (f : R R) f(x) = 0 (x cos y, 2y sin x) = (0, 0) (f :

More information

MATH1050 Greatest/least element, upper/lower bound

MATH1050 Greatest/least element, upper/lower bound MATH1050 Greatest/ element, upper/lower bound 1 Definition Let S be a subset of R x λ (a) Let λ S λ is said to be a element of S if, for any x S, x λ (b) S is said to have a element if there exists some

More information

Self-Referentiality, Fractels, and Applications

Self-Referentiality, Fractels, and Applications Self-Referentiality, Fractels, and Applications Peter Massopust Center of Mathematics Research Unit M15 Technical University of Munich Germany 2nd IM-Workshop on Applied Approximation, Signals, and Images,

More information

Rolle s theorem: from a simple theorem to an extremely powerful tool

Rolle s theorem: from a simple theorem to an extremely powerful tool Rolle s theorem: from a simple theorem to an extremely powerful tool Christiane Rousseau, Université de Montréal November 10, 2011 1 Introduction How many solutions an equation or a system of equations

More information

Permuting the partitions of a prime

Permuting the partitions of a prime Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Permuting the partitions of a prime par Stéphane VINATIER Résumé. Étant donné un nombre premier p impair, on caractérise les partitions l de

More information

Calculus of Variations

Calculus of Variations Calc. Var. (2004) DOI: 10.1007/s00526-004-0275-8 Calculus of Variations Ovidiu Savin The obstacle problem for Monge Ampere equation Received: 4 February 2003 / Accepted: 3 March 2004 Published online:

More information

1.8 Dual Spaces (non-examinable)

1.8 Dual Spaces (non-examinable) 2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,

More information

Geometric Interpolation by Planar Cubic Polynomials

Geometric Interpolation by Planar Cubic Polynomials 1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,

More information

Mathematics for Economists

Mathematics for Economists Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples

More information

4. Noether normalisation

4. Noether normalisation 4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith

More information

2 Two-Point Boundary Value Problems

2 Two-Point Boundary Value Problems 2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x

More information

2: LINEAR TRANSFORMATIONS AND MATRICES

2: LINEAR TRANSFORMATIONS AND MATRICES 2: LINEAR TRANSFORMATIONS AND MATRICES STEVEN HEILMAN Contents 1. Review 1 2. Linear Transformations 1 3. Null spaces, range, coordinate bases 2 4. Linear Transformations and Bases 4 5. Matrix Representation,

More information

Symmetric functions and the Vandermonde matrix

Symmetric functions and the Vandermonde matrix J ournal of Computational and Applied Mathematics 172 (2004) 49-64 Symmetric functions and the Vandermonde matrix Halil Oruç, Hakan K. Akmaz Department of Mathematics, Dokuz Eylül University Fen Edebiyat

More information

Notes on Continued Fractions for Math 4400

Notes on Continued Fractions for Math 4400 . Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural

More information

Home Page. Title Page. Contents. Bezier Curves. Milind Sohoni sohoni. Page 1 of 27. Go Back. Full Screen. Close.

Home Page. Title Page. Contents. Bezier Curves. Milind Sohoni  sohoni. Page 1 of 27. Go Back. Full Screen. Close. Bezier Curves Page 1 of 27 Milind Sohoni http://www.cse.iitb.ac.in/ sohoni Recall Lets recall a few things: 1. f : [0, 1] R is a function. 2. f 0,..., f i,..., f n are observations of f with f i = f( i

More information

Smooth Path Generation Based on Bézier Curves for Autonomous Vehicles

Smooth Path Generation Based on Bézier Curves for Autonomous Vehicles Smooth Path Generation Based on Bézier Curves for Autonomous Vehicles Ji-wung Choi, Renwick E. Curry, Gabriel Hugh Elkaim Abstract In this paper we present two path planning algorithms based on Bézier

More information

A TWO-DIMENSIONAL PÓLYA-TYPE MAP FILLING A PYRAMID. Pan Liu

A TWO-DIMENSIONAL PÓLYA-TYPE MAP FILLING A PYRAMID. Pan Liu A TWO-DIMENSIONAL PÓLYA-TYPE MAP FILLING A PYRAMID Pan Liu Department of Mathematical Sciences, Worcester Polytechnic Institute, 100 Institute Road, Worcester MA 01609-80, USA Abstract We construct a family

More information

Anna D Aloise May 2, 2017 INTD 302: Final Project. Demonstrate an Understanding of the Fundamental Concepts of Calculus

Anna D Aloise May 2, 2017 INTD 302: Final Project. Demonstrate an Understanding of the Fundamental Concepts of Calculus Anna D Aloise May 2, 2017 INTD 302: Final Project Demonstrate an Understanding of the Fundamental Concepts of Calculus Analyzing the concept of limit numerically, algebraically, graphically, and in writing.

More information

CHAPTER 4 Knot insertion

CHAPTER 4 Knot insertion CHAPTER 4 Knot insertion In Chapter we were led to B-splines, defined via the recurrence relation, as a convenient way to represent spline functions In Chapters 2 and 3 we then established some of the

More information

Nonstationary Subdivision Schemes and Totally Positive Refinable Functions

Nonstationary Subdivision Schemes and Totally Positive Refinable Functions Nonstationary Subdivision Schemes and Totally Positive Refinable Functions Laura Gori and Francesca Pitolli December, 2007 Abstract In this paper we construct a class of totally positive refinable functions,

More information

CSE 167: Lecture 11: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012

CSE 167: Lecture 11: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012 CSE 167: Introduction to Computer Graphics Lecture 11: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012 Announcements Homework project #5 due Nov. 9 th at 1:30pm

More information

12. Hilbert Polynomials and Bézout s Theorem

12. Hilbert Polynomials and Bézout s Theorem 12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of

More information

Sébastien Chaumont a a Institut Élie Cartan, Université Henri Poincaré Nancy I, B. P. 239, Vandoeuvre-lès-Nancy Cedex, France. 1.

Sébastien Chaumont a a Institut Élie Cartan, Université Henri Poincaré Nancy I, B. P. 239, Vandoeuvre-lès-Nancy Cedex, France. 1. A strong comparison result for viscosity solutions to Hamilton-Jacobi-Bellman equations with Dirichlet condition on a non-smooth boundary and application to parabolic problems Sébastien Chaumont a a Institut

More information

Outline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations

Outline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign

More information

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim Introduction - Motivation Many phenomena (physical, chemical, biological, etc.) are model by differential equations. Recall the definition of the derivative of f(x) f f(x + h) f(x) (x) = lim. h 0 h Its

More information

Introduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama

Introduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.

More information

Key words. n-d systems, free directions, restriction to 1-D subspace, intersection ideal.

Key words. n-d systems, free directions, restriction to 1-D subspace, intersection ideal. ALGEBRAIC CHARACTERIZATION OF FREE DIRECTIONS OF SCALAR n-d AUTONOMOUS SYSTEMS DEBASATTAM PAL AND HARISH K PILLAI Abstract In this paper, restriction of scalar n-d systems to 1-D subspaces has been considered

More information

An unconditionally convergent method for computing zeros of splines and polynomials

An unconditionally convergent method for computing zeros of splines and polynomials An unconditionally convergent method for computing zeros of splines and polynomials Knut Mørken and Martin Reimers November 24, 2005 Abstract We present a simple and efficient method for computing zeros

More information

ACCRS/QUALITY CORE CORRELATION DOCUMENT: ALGEBRA II

ACCRS/QUALITY CORE CORRELATION DOCUMENT: ALGEBRA II ACCRS/QUALITY CORE CORRELATION DOCUMENT: ALGEBRA II Revised May 2013 Perform arithmetic operations with complex numbers. 1. [N-CN1] Know there is a complex number i such that i 2 = 1, and every complex

More information

Introduction to Decision Sciences Lecture 6

Introduction to Decision Sciences Lecture 6 Introduction to Decision Sciences Lecture 6 Andrew Nobel September 21, 2017 Functions Functions Given: Sets A and B, possibly different Definition: A function f : A B is a rule that assigns every element

More information

Bézier Curves and Splines

Bézier Curves and Splines CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100

More information