Rational Bézier Patch Differentiation using the. Rational Forward Difference Operator
|
|
- Imogene Edwards
- 5 years ago
- Views:
Transcription
1 Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen Richard Riesenfeld Elaine Cohen School of Computing University of Utah CGI 05 p.1/37
2 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. CGI 05 p.2/37
3 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, CGI 05 p.2/37
4 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension CGI 05 p.2/37
5 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension Zheng and Sederberg [Zheng03] derive simple formulation for rational surface curvature, emphasizing the geometric intuition CGI 05 p.2/37
6 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension Zheng and Sederberg [Zheng03] derive simple formulation for rational surface curvature, emphasizing the geometric intuition We focus on the derivation of a general formulation for differentiation based on rational control mesh CGI 05 p.2/37
7 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension Zheng and Sederberg [Zheng03] derive simple formulation for rational surface curvature, emphasizing the geometric intuition We focus on the derivation of a general formulation for differentiation based on rational control mesh specialization to polynomial case. CGI 05 p.2/37
8 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension Zheng and Sederberg [Zheng03] derive simple formulation for rational surface curvature, emphasizing the geometric intuition We focus on the derivation of a general formulation for differentiation based on rational control mesh specialization to polynomial case. dimension extension CGI 05 p.2/37
9 Introduction For polynomial Bézier patches, the formulation is elegant and well-known [Farin02, Hoschek93, Cohen01]. For rational Bézier patches, Use quotient rule. Complicated for higher order and/or dimension Zheng and Sederberg [Zheng03] derive simple formulation for rational surface curvature, emphasizing the geometric intuition We focus on the derivation of a general formulation for differentiation based on rational control mesh specialization to polynomial case. dimension extension simple and unified implementation CGI 05 p.2/37
10 Recall: Polynomial Fwd Diff & Deriv Curves: 0 [i] = P [i] r [i] = r 1 [i + 1] r 1 [i] x r (0) = n! (n r)! r[0] CGI 05 p.3/37
11 Recall: Polynomial Fwd Diff & Deriv Curves: Surfaces: 0 [i] = P [i] r [i] = r 1 [i + 1] r 1 [i] x r (0) = 00 [i][j] = P [i][j] n! (n r)! r[0] rs [i][j] = r 1,s [i + 1][j] r 1,s [i][j] or rs [i][j] = r,s 1 [i][j + 1] r,s 1 [i][j] x rs (0, 0) = m! (m r)! n! (n s)! rs[0][0] CGI 05 p.3/37
12 Question? Can we find similar formulations for rational Bézier curves/surfaces? CGI 05 p.4/37
13 Answer Partly Yes, CGI 05 p.5/37
14 Answer Partly Yes, We are able to define, the rational forward difference operator. CGI 05 p.5/37
15 Answer Partly Yes, We are able to define, the rational forward difference operator. Have similar formulation for curve differentiation of 1 st, 2 nd, and 3 rd order. CGI 05 p.5/37
16 Answer Partly Yes, We are able to define, the rational forward difference operator. Have similar formulation for curve differentiation of 1 st, 2 nd, and 3 rd order. Have similar formulation for surface differentiation of 1 st and 2 nd order. CGI 05 p.5/37
17 Shape Computation κ = x x x 3 τ = [x x x ] x x = (x x ) x 2 x x ( ) 2 L M II =, where L = x M N uu N = x uu (x u x v ) x u x v, etc CGI 05 p.6/37
18 Shape Computation κ = x x x 3 τ = [x x x ] x x = (x x ) x 2 x x ( ) 2 L M II =, where L = x M N uu N = x uu (x u x v ) x u x v, etc Components depending on lower order derivatives: No Effect on shape computation! CGI 05 p.6/37
19 Equivalent Derivatives For any coefficients a and b Curves x = x + ax x = x + ax + bx CGI 05 p.7/37
20 Equivalent Derivatives For any coefficients a and b Curves x = x + ax Surfaces x = x + ax + bx x uv = x uv + ax u + bx v x uu = x uu + ax u + bx v x vv = x vv + ax u + bx v CGI 05 p.7/37
21 Equivalent Derivatives For any coefficients a and b Curves x = x + ax Surfaces x = x + ax + bx x uv = x uv + ax u + bx v x uu = x uu + ax u + bx v x vv = x vv + ax u + bx v x and x have the same effect for shape computation CGI 05 p.7/37
22 Example x [x ] x CGI 05 p.8/37
23 Fast Forward: Results of Rational Bézier Curve Rational Case x (0) = n 1 [0] x (0) = n(n 1) 2 [0] x (0) = n(n 1)(n 2) 3 [0] CGI 05 p.9/37
24 Fast Forward: Results of Rational Bézier Curve Rational Case x (0) = n 1 [0] x (0) = n(n 1) 2 [0] x (0) = n(n 1)(n 2) 3 [0] Polynomial case x (0) = n 1 [0] x (0) = n(n 1) 2 [0] x (0) = n(n 1)(n 2) 3 [0] CGI 05 p.9/37
25 Fast Forward: Results of Rational Bézier Curve Rational Case x (0) = n 1 [0] x (0) = n(n 1) 2 [0] x (0) = n(n 1)(n 2) 3 [0] CGI 05 p.9/37
26 Fast Forward: Results of Rational Bézier Surface Rational Case x u (0, 0) = m 10 [0][0] x v (0, 0) = m 01 [0][0] x uu (0, 0) = m(m 1) 20 [0][0] x uv (0, 0) = mn 11 [0][0] x vv (0, 0) = n(n 1) 02 [0][0] CGI 05 p.10/37
27 Fast Forward: Results of Rational Bézier Surface Rational Case x u (0, 0) = m 10 [0][0] x v (0, 0) = m 01 [0][0] x uu (0, 0) = m(m 1) 20 [0][0] x uv (0, 0) = mn 11 [0][0] x vv (0, 0) = n(n 1) 02 [0][0] Polynomial Case x u (0, 0) = m 10 [0][0] x v (0, 0) = m 01 [0][0] x uu (0, 0) = m(m 1) 20 [0][0] x uv (0, 0) = mn 11 [0][0] x vv (0, 0) = n(n 1) 02 [0][0] CGI 05 p.10/37
28 Fast Forward: Results of Rational Bézier Surface Rational Case x u (0, 0) = m 10 [0][0] x v (0, 0) = m 01 [0][0] x uu (0, 0) = m(m 1) 20 [0][0] x uv (0, 0) = mn 11 [0][0] x vv (0, 0) = n(n 1) 02 [0][0] CGI 05 p.10/37
29 Curvature and Torsion κ = x x x 3 = n 1 n = x x x CGI 05 p.11/37
30 Curvature and Torsion κ = x x x 3 = n 1 n = x x x τ = [x x x ] x x 2 = [x x x ] x x 2 = n 2 n [ ] CGI 05 p.11/37
31 First Fundamental Form ( ) E F I = = F G ( ) xu x u x u x v x v x u x v x v = ( mm mn nm nn ) CGI 05 p.12/37
32 Second Fundamental Form ( ) L M II = M N = x uu n x uv N = x vu n x vv N x uu n x uv N x vu n x vv N = m(m 1) [ ] mn [ ] nm [ ] n(n 1) [ ] CGI 05 p.13/37
33 To Be Defined So, What is the Rational Forward Operator,? CGI 05 p.14/37
34 Homogeneous Point [0, 12, 4] [4, 6, 2] homogeneous point [P, W ], where P R n, W R represents the Euclidean point P/W R n [4, 0, 2] CGI 05 p.15/37
35 Rational Forward Operator For a rational control mesh of points [P, W ], P R n and W R, define where r : r (P, W )[s] = r(p )[s]w [s] r (W )[s]p [s] W [s] 2 the orders of all (partial) derivatives, such as 2 (curves), 02 (surfaces) etc. s : the indices to the control point, where the r-th order rational forward difference is evaluated, such as [1] or [0][1]. r (P )[s] : the usual polynomial forward difference of order r at the s-th control point of control mesh P in R n r (W )[s] : the usual polynomial forward difference of order r at the s-th control point of control mesh W in R 1 CGI 05 p.16/37
36 Side Note:Implementation Apply polynomial forward difference operator to the control mesh CGI 05 p.17/37
37 Side Note:Implementation Apply polynomial forward difference operator to the control mesh If rational Bézier, i.e., controls points actually in homogeneous form, apply the rationalization procedure in the definition CGI 05 p.17/37
38 Side Note:Implementation Apply polynomial forward difference operator to the control mesh If rational Bézier, i.e., controls points actually in homogeneous form, apply the rationalization procedure in the definition Shape computation based on rational/polynomial forward difference CGI 05 p.17/37
39 Why? Bézier Curve Bézier Surface x (0) = n 1 [0] x (0) = n(n 1) 2 [0] x (0) = n(n 1)(n 2) 3 [0] x u (0, 0) = m 10 [0][0], x v (0, 0) = m 01 [0][0] x uu (0, 0) = m(m 1) 20 [0][0] x uv (0, 0) = mn 11 [0][0] x vv (0, 0) = n(n 1) 02 [0][0] CGI 05 p.18/37
40 Bézier Curves: 1 st Order Derivative x(t) = p(t) w(t), x (t) = (p w w p) w 2, p = n(p [1] P [0] = n 1 (P ), w = n(w [1] W [0]) = n 1 (W ), x = n 1(P )W [0] 1 (W )P [0] W [0] 2, CGI 05 p.19/37
41 Bézier Curves: 1 st Order Derivative x = n 1. x(t) = p(t) w(t), x (t) = (p w w p) w 2, p = n(p [1] P [0] = n 1 (P ), w = n(w [1] W [0]) = n 1 (W ), x = n 1(P )W [0] 1 (W )P [0] W [0] 2, CGI 05 p.19/37
42 Bézier Curves: 1 st Order Derivative x = n 1. x(t) = p(t) w(t), x (t) = (p w w p) w 2, p = n(p [1] P [0] = n 1 (P ), w = n(w [1] W [0]) = n 1 (W ), x = n 1(P )W [0] 1 (W )P [0] W [0] 2, CGI 05 p.19/37
43 Bézier Curves: 2 nd Order Derivative x = (p w w p) w 2 x = (p w w p) w 2 + (p w w p ) w 2 + (p w w p) ( 1 w 2 ) CGI 05 p.20/37
44 Bézier Curves: 2 nd Order Derivative x = (p w w p) w 2 x = (p w w p) w 2 + (p w w p ) w 2 + (p w w p) ( 1 w 2 ) 2 nd term is 0 CGI 05 p.20/37
45 Bézier Curves: 2 nd Order Derivative x = (p w w p) w 2 x = (p w w p) w 2 + (p w w p ) w 2 + (p w w p) ( 1 w 2 ), 2 nd term is 0, 3 rd term is parallel to x. Therefore CGI 05 p.20/37
46 Bézier Curves: 2 nd Order Derivative x = (p w w p) w 2 x = (p w w p) w 2 + (p w w p ) w 2 + (p w w p) ( 1 w 2 ), 2 nd term is 0, 3 rd term is parallel to x. Therefore x = (p w w p) w 2 x = n(n 1) 2 CGI 05 p.20/37
47 Bézier Curves: 2 nd Order Derivative x = (p w w p) w 2 x = (p w w p) w 2 + (p w w p ) w 2 + (p w w p) ( 1 w 2 ), 2 nd term is 0, 3 rd term is parallel to x. Therefore x = (p w w p) w 2 x = n(n 1) 2 CGI 05 p.20/37
48 Bézier Curves: 3 rd Order Derivative x = (p w w p) w 2 + (p w w p) ( 1 w 2 ) CGI 05 p.21/37
49 Bézier Curves: 3 rd Order Derivative x = (p w w p) w 2 + (p w w p) ( 1 w 2 ) Differentiating 2 nd term generates only terms which are spanned by x and x, and can be discarded x = p w w p + p w w p w 2 w 2 CGI 05 p.21/37
50 Bézier Curves: 3 rd Order Derivative x = (p w w p) w 2 + (p w w p) ( 1 w 2 ) Differentiating 2 nd term generates only terms which are spanned by x and x, and can be discarded x = p w w p + p w w p w 2 w 2 If p w w p w 2 is spanned by (x, x ), i.e., (p w w p, p w w p), we would have x = n(n 1)(n 2) 3 CGI 05 p.21/37
51 Bézier Curves: 3 rd Order Derivative x = (p w w p) w 2 + (p w w p) ( 1 w 2 ) Differentiating 2 nd term generates only terms which are spanned by x and x, and can be discarded x = p w w p + p w w p w 2 w 2 If p w w p w 2 is spanned by (x, x ), i.e., (p w w p, p w w p), we would have x = n(n 1)(n 2) 3 CGI 05 p.21/37
52 Proof for 3 rd Order Equivalent Derivative Vanishing triple scalar product. (p w w p) (p w w p) (p w w p ) = ((p p )w 2 (p p )ww (p p)ww ) (p w w p ) = (p p )ww w p (p p)ww p w = 0 CGI 05 p.22/37
53 Bézier Surfaces: 1 st Order Derivative x(u, v) = p(u, v) w(u, v) x u = (p uw w u p), x w 2 v = (p vw w v p) w 2 x u = m 10(P )W [0][0] 10 (W )P [0][0] W [0][0] 2 = m 10 x v = n 01(P )W [0][0] 01 (W )P [0][0] W [0][0] 2 = n 01 CGI 05 p.23/37
54 Bézier Surfaces: 2 nd Order Derivative x uu = m(m 1) 20, x vv = n(n 1) 02 CGI 05 p.24/37
55 Bézier Surfaces: 2 nd Order Derivative x uu = m(m 1) 20, x vv = n(n 1) 02 x u = (p uw w u p) w 2 x uv = (p uvw w uv p) + (p uw v w u p v ) w 2 w 2 CGI 05 p.24/37
56 Bézier Surfaces: 2 nd Order Derivative x uu = m(m 1) 20, x vv = n(n 1) 02 x u = (p uw w u p) w 2 x uv = (p uvw w uv p) + (p uw v w u p v ) w 2 w 2 2 nd term in the tangent plane, ((p u w w u p) (p v w w v p)) (p u w v w u p v ) = (w 2 p u p v w u wp p v ww v p u p) (p u w v w u p v ) = w u ww v [pp v p u ] + ww v w u [p u pp v ] = 0 CGI 05 p.24/37
57 Bézier Surfaces: 2 nd Order Derivative x uu = m(m 1) 20, x vv = n(n 1) 02 x u = (p uw w u p) w 2 x uv = (p uvw w uv p) + (p uw v w u p v ) w 2 w 2 2 nd term in the tangent plane, ((p u w w u p) (p v w w v p)) (p u w v w u p v ) = (w 2 p u p v w u wp p v ww v p u p) (p u w v w u p v ) = w u ww v [pp v p u ] + ww v w u [p u pp v ] = 0 x uv = mn 11 CGI 05 p.24/37
58 Bézier Surfaces: 2 nd Order Derivative x uu = m(m 1) 20, x vv = n(n 1) 02 x u = (p uw w u p) w 2 x uv = (p uvw w uv p) + (p uw v w u p v ) w 2 w 2 2 nd term in the tangent plane, ((p u w w u p) (p v w w v p)) (p u w v w u p v ) = (w 2 p u p v w u wp p v ww v p u p) (p u w v w u p v ) = w u ww v [pp v p u ] + ww v w u [p u pp v ] = 0 x uv = mn 11 CGI 05 p.24/37
59 Ex.1: Curvature of Ellipse [0, 2b, 2 ] [a, b, 1] Consider first quadrant The control mesh, x 2 a 2 + y2 b 2 = 1 [P, W ][0] = [a, 0, 1] [P, W ][1] = [a, b, 1] [P, W ][2] = [0, 2b, 2] Y Z X [a, 0, 1] CGI 05 p.25/37
60 Ex. 1: Curvatures of An Ellipse -Cont. 1 First order polynomial forward differences at the 0-th control point. 1 (P )[0] = P [1] P [0] = [a, b] [a, 0] = [0, b] 1 (W )[0] = W [1] W [0] = 0 CGI 05 p.26/37
61 Ex. 1: Curvatures of An Ellipse -Cont. 1 First order polynomial forward differences at the 0-th control point. 1 (P )[0] = P [1] P [0] = [a, b] [a, 0] = [0, b] 1 (W )[0] = W [1] W [0] = 0 First order rational forward differences at the 0-th control point. 1 [0] = 1(P )[0] W [0] 1 (W )[0] P [0] W [0] 2 = [0, b] + 0[a, 0] 1 = [0, b] CGI 05 p.26/37
62 Ex. 1: Curvatures of An Ellipse -Cont. 2 1 (P )[1] = P [2] P [1] = [0, 2b] [a, b] = [ a, b] 1 (W )[1] = W [2] W [1] = 1 2 (P )[0] = 1 (P )[1] 1 (P )[0] = [ a, 0] 2 (W )[0] = 1 (W )[1] 1 (W )[0] = 1 CGI 05 p.27/37
63 Ex. 1: Curvatures of An Ellipse -Cont. 2 1 (P )[1] = P [2] P [1] = [0, 2b] [a, b] = [ a, b] 1 (W )[1] = W [2] W [1] = 1 2 (P )[0] = 1 (P )[1] 1 (P )[0] = [ a, 0] 2 (W )[0] = 1 (W )[1] 1 (W )[0] = 1 2 [0] = 2(P )[0] W [0] 2 (W )[0] P [0] W [0] 2 = [ a, 0] [a, 0] 1 = [ 2a, 0] CGI 05 p.27/37
64 Ex. 1: Curvatures of An Ellipse -Cont. 3 At (a, 0), the ellipse has a curvature of, x 2 a 2 + y2 b 2 = 1, κ = n 1 n = 2ab 2b = a/b2 1 3 CGI 05 p.28/37
65 Rational Fwd Diff in the Context of NURBS [-a, 3b, 3] [a, b, 1] Y Z X Same ellipse, but defined with knot vector 1, 0, 1, 2, [a, -b, 1] CGI 05 p.29/37
66 What Changes We Have to Make Polynomial forward difference has to be normalized CGI 05 p.30/37
67 What Changes We Have to Make Polynomial forward difference has to be normalized Apply rationalization the same way to get our rational forward difference CGI 05 p.30/37
68 NURBS: Normalized Polynomial Fwd Diff knot vector: 1, 0, 1, 2, control mesh: [P, W ][0] = [a, b, 1], [P, W ][1] = [a, b, 1], [P, W ][2] = [ a, 3b, 3] CGI 05 p.31/37
69 NURBS: Normalized Polynomial Fwd Diff knot vector: 1, 0, 1, 2, control mesh: [P, W ][0] = [a, b, 1], [P, W ][1] = [a, b, 1], [P, W ][2] = [ a, 3b, 3] 1 st order polynomial forward differences at the 0-th control point. 1 (P )[0] = 1 (W )[0] = P [1] P [0] = 1 ( 1) W [1] W [0] 1 ( 1) [a, b] [a, b] 2 = 0 = [0, b] CGI 05 p.31/37
70 NURBS: Normalized Polynomial Fwd Diff knot vector: 1, 0, 1, 2, control mesh: [P, W ][0] = [a, b, 1], [P, W ][1] = [a, b, 1], [P, W ][2] = [ a, 3b, 3] 1 st order polynomial forward differences at the 0-th control point. 1 (P )[0] = 1 (W )[0] = Normalization factor P [1] P [0] = 1 ( 1) W [1] W [0] 1 ( 1) [a, b] [a, b] 2 = 0 = [0, b] CGI 05 p.31/37
71 NURBS: Normalized Polynomial Fwd Diff knot vector: 1, 0, 1, 2, control mesh: [P, W ][0] = [a, b, 1], [P, W ][1] = [a, b, 1], [P, W ][2] = [ a, 3b, 3] 1 st order polynomial forward differences at the 0-th control point. 1 (P )[0] = 1 (W )[0] = Normalization factor P [1] P [0] = 1 ( 1) W [1] W [0] 1 ( 1) [a, b] [a, b] 2 = 0 from the knot vector. = [0, b] CGI 05 p.31/37
72 NURBS: 1 st Order Rational Fwd Diff 1 [0] = 1(P )[0] W [0] 1 (W )[0] P [0] W [0] 2 = [0, b] 0[a, b] 1 2 = [0, b] CGI 05 p.32/37
73 NURBS: 2 nd Order Rational Fwd Diff Normalized polynomial forward differences P [2] P [1] [ a, 3b] [a, b] 1 (P )[1] = = = [ a, b], W [2] W [1] 1 (W )[1] = = (P )[0] = 1(P )[1] 1 (P )[0] = [ a, b] [0, b] = [ a, 0], (W )[0] = 1(W )[1] 1 (W )[0] = CGI 05 p.33/37
74 NURBS: 2 nd Order Rational Fwd Diff Normalized polynomial forward differences Rationalization P [2] P [1] [ a, 3b] [a, b] 1 (P )[1] = = = [ a, b], W [2] W [1] 1 (W )[1] = = (P )[0] = 1(P )[1] 1 (P )[0] = [ a, b] [0, b] = [ a, 0], (W )[0] = 1(W )[1] 1 (W )[0] = [0] = 2(P )[0] W [0] 2 (W )[0] P [0] W [0] 2 = [ a, 0] [a, b] 1 2 = [ 2a, b] CGI 05 p.33/37
75 Curvature of B-spline Ellipse [-a, 3b, 3] [a, b, 1] Y Z X [a, -b, 1] κ = n 1 n = 2ab 2b 3 = a b CGI 05 p.34/37
76 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i CGI 05 p.35/37
77 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i CGI 05 p.35/37
78 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i x ti t j = (p t i t j w w ti t j p) + (p t i w tj w ti p tj ) w 2 w 2 CGI 05 p.35/37
79 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i x ti t j = (p t i t j w w ti t j p) + (p t i w tj w ti p tj ) w 2 w 2 Again, the 2 nd term is in the tangent hyper-plane, because [(p t0 w w t0 p) (p tm 1 w w tm 1 p) (p ti w tj w ti p tj )] = [( w m 1 w ti ) p t0 p ti 1 p p ti+1 p tm 1 (p ti w tj )] = 0 [( w m 1 w tj ) p t0 p tj 1 p p tj+1 p tm 1 (p tj w ti )] CGI 05 p.35/37
80 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i x ti t j = (p t i t j w w ti t j p) + (p t i w tj w ti p tj ) w 2 w 2 Again, the 2 nd term is in the tangent hyper-plane, because [(p t0 w w t0 p) (p tm 1 w w tm 1 p) (p ti w tj w ti p tj )] = [( w m 1 w ti ) p t0 p ti 1 p p ti+1 p tm 1 (p ti w tj )] = 0 [( w m 1 w tj ) p t0 p tj 1 p p tj+1 p tm 1 (p tj w ti )] x ti t i = n i (n i 1) ti t i, i = 0,, m 1 x ti t j = n i n j ti t j, i, j = 0,, m 1, i j CGI 05 p.35/37
81 Rational Bézier Hyper-Surfaces: 2 nd order derivatives x ti = t i ( ) p(t 0,,t m 1 ) w(t 0,,t m 1 ) = p t i w w ti p w 2 = n i i x ti t j = (p t i t j w w ti t j p) + (p t i w tj w ti p tj ) w 2 w 2 Again, the 2 nd term is in the tangent hyper-plane, because [(p t0 w w t0 p) (p tm 1 w w tm 1 p) (p ti w tj w ti p tj )] = [( w m 1 w ti ) p t0 p ti 1 p p ti+1 p tm 1 (p ti w tj )] = 0 [( w m 1 w tj ) p t0 p tj 1 p p tj+1 p tm 1 (p tj w ti )] x ti t i = n i (n i 1) ti t i, i = 0,, m 1 x ti t j = n i n j ti t j, i, j = 0,, m 1, i j CGI 05 p.35/37
82 Any Questions? CGI 05 p.36/37
83 Thanks! CGI 05 p.37/37
84 References [Cohen01] [Farin02] Elaine Cohen, Richard F. Riesenfeld, and Gershon Elber. Geometric Modeling with Splines:An Introduction. A K Peters, 1 edition, Gerald Farin. Curves and Surfaces for CAGD: A Practical Guide. Academic Press, 5 edition, [Hoschek93] Josef Hoschek, Dieter Lasser, and Larry L. Schumaker. Fundamentals of computer aided geometric design. A. K. Peters, Ltd., ISBN [Zheng03] Jianmin Zheng and T. W. Sederberg. Gaussian and mean curvatures of rational Bézier patches. Computer Aided Geometric Design, 20(6): ,
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen, Richard F. Riesenfeld, Elaine Cohen School of Computing, University of Utah Abstract This paper introduces
More informationSample Exam 1 KEY NAME: 1. CS 557 Sample Exam 1 KEY. These are some sample problems taken from exams in previous years. roughly ten questions.
Sample Exam 1 KEY NAME: 1 CS 557 Sample Exam 1 KEY These are some sample problems taken from exams in previous years. roughly ten questions. Your exam will have 1. (0 points) Circle T or T T Any curve
More informationComputer 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 informationHermite Interpolation with Euclidean Pythagorean Hodograph Curves
Hermite Interpolation with Euclidean Pythagorean Hodograph Curves Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 86 75 Praha 8 zbynek.sir@mff.cuni.cz Abstract.
More informationIntroduction of Singularity Theory on Curves
Introduction of Singularity Theory on Curves Xianming Chen School of Computing, University of Utah, Salt Lake City, UT 84112 1 Introduction This introduction is based on the book Curves And Singularities
More informationIntroduction. Chapter Points, Vectors and Coordinate Systems
Chapter 1 Introduction Computer aided geometric design (CAGD) concerns itself with the mathematical description of shape for use in computer graphics, manufacturing, or analysis. It draws upon the fields
More informationConversion of Quadrics into Rational Biquadratic Bézier Patches
Conversion of Quadrics into Rational Biquadratic Bézier Patches Lionel Garnier, Sebti Foufou, and Dominique Michelucci LEI, UMR CNRS 558 UFR Sciences, University of Burgundy, BP 7870, 078 Dijon Cedex,
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationLecture 23: Hermite and Bezier Curves
Lecture 23: Hermite and Bezier Curves November 16, 2017 11/16/17 CSU CS410 Fall 2017, Ross Beveridge & Bruce Draper 1 Representing Curved Objects So far we ve seen Polygonal objects (triangles) and Spheres
More informationb 1 b 2.. b = b m A = [a 1,a 2,...,a n ] where a 1,j a 2,j a j = a m,j Let A R m n and x 1 x 2 x = x n
Lectures -2: Linear Algebra Background Almost all linear and nonlinear problems in scientific computation require the use of linear algebra These lectures review basic concepts in a way that has proven
More informationCurves, 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 informationSurface x(u, v) and curve α(t) on it given by u(t) & v(t). Math 4140/5530: Differential Geometry
Surface x(u, v) and curve α(t) on it given by u(t) & v(t). α du dv (t) x u dt + x v dt Surface x(u, v) and curve α(t) on it given by u(t) & v(t). α du dv (t) x u dt + x v dt ( ds dt )2 Surface x(u, v)
More informationConstrained Ultraspherical-Weighted Orthogonal Polynomials on Triangle
International Journal of Mathematical Analysis Vol. 9, 15, no., 61-7 HIKARI Ltd, www.m-hiari.com http://dx.doi.org/1.1988/ijma.15.411339 Constrained Ultraspherical-Weighted Orthogonal Polynomials on Triangle
More informationChristoffel symbols and Gauss Theorema Egregium
Durham University Pavel Tumarkin Epiphany 207 Dierential Geometry III, Solutions 5 (Week 5 Christoel symbols and Gauss Theorema Egregium 5.. Show that the Gauss curvature K o the surace o revolution locally
More informationThe 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 informationEXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE
J. KSIAM Vol.13, No.4, 257 265, 2009 EXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE YEON SOO KIM 1 AND YOUNG JOON AHN 2 1 DEPT OF MATHEMATICS, AJOU UNIVERSITY, SUWON, 442 749,
More informationLectures 15: Parallel Transport. Table of contents
Lectures 15: Parallel Transport Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In this lecture we study the
More informationApproximation of Circular Arcs by Parametric Polynomial Curves
Approximation of Circular Arcs by Parametric Polynomial Curves Gašper Jaklič Jernej Kozak Marjeta Krajnc Emil Žagar September 19, 005 Abstract In this paper the approximation of circular arcs by parametric
More information1.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 informationSpiral spline interpolation to a planar spiral
Spiral spline interpolation to a planar spiral Zulfiqar Habib Department of Mathematics and Computer Science, Graduate School of Science and Engineering, Kagoshima University Manabu Sakai Department of
More informationA general 4th-order PDE method to generate Bézier surfaces from the boundary
Computer Aided Geometric Design 3 006) 08 5 www.elsevier.com/locate/cagd A general 4th-order PDE method to generate Bézier surfaces from the boundary J. Monterde a,,h.ugail b a Dep. de Geometria i Topologia,
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 0 October 2002 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationVector Spaces and Subspaces
Vector Spaces and Subspaces Our investigation of solutions to systems of linear equations has illustrated the importance of the concept of a vector in a Euclidean space. We take time now to explore the
More informationThe Gram-Schmidt Process 1
The Gram-Schmidt Process In this section all vector spaces will be subspaces of some R m. Definition.. Let S = {v...v n } R m. The set S is said to be orthogonal if v v j = whenever i j. If in addition
More informationThe Algebra and Geometry of Curve and Surface Inversion
Brigham Young University BYU ScholarsArchive All Faculty Publications 2002-01-01 The Algebra and Geometry of Curve and Surface Inversion Thomas W. Sederberg tom@cs.byu.edu Eng-Wee Chionh See next page
More informationInner Product Spaces 5.2 Inner product spaces
Inner Product Spaces 5.2 Inner product spaces November 15 Goals Concept of length, distance, and angle in R 2 or R n is extended to abstract vector spaces V. Sucn a vector space will be called an Inner
More informationAn 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 informationOn Rational Minkowski Pythagorean Hodograph Curves
DEPT. OF MATH./CMA UNIVERSITY OF OSLO PURE MATHEMATICS NO 23 ISSN 0806 2439 DECEMBER 2009 On Rational Minkowski Pythagorean Hodograph Curves Jiří Kosinka and Miroslav Lávička December 8, 2009 Abstract
More informationBernstein 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 informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 29 September 205 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationTetrahedral C m Interpolation by Rational Functions
Tetrahedral C m Interpolation by Rational Functions Guoliang Xu State Key Laboratory of Scientific and Engineering Computing, ICMSEC, Chinese Academy of Sciences Chuan I Chu Weimin Xue Department of Mathematics,
More informationLecture 20: Bezier Curves & Splines
Lecture 20: Bezier Curves & Splines December 6, 2016 12/6/16 CSU CS410 Bruce Draper & J. Ross Beveridge 1 Review: The Pen Metaphore Think of putting a pen to paper Pen position described by time t Seeing
More informationAlgebraic Geometry for CAGD
Chapter 17 Algebraic Geometry for CAGD Initially, the field of computer aided geometric design and graphics drew most heavily from differential geometry, approximation theory, and vector geometry. Since
More informationChapter y. 8. n cd (x y) 14. (2a b) 15. (a) 3(x 2y) = 3x 3(2y) = 3x 6y. 16. (a)
Chapter 6 Chapter 6 opener A. B. C. D. 6 E. 5 F. 8 G. H. I. J.. 7. 8 5. 6 6. 7. y 8. n 9. w z. 5cd.. xy z 5r s t. (x y). (a b) 5. (a) (x y) = x (y) = x 6y x 6y = x (y) = (x y) 6. (a) a (5 a+ b) = a (5
More informationReading. w Foley, Section 11.2 Optional
Parametric Curves w Foley, Section.2 Optional Reading w Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics and Geometric Modeling, 987. w Farin. Curves and Surfaces for
More information9.5. Polynomial and Rational Inequalities. Objectives. Solve quadratic inequalities. Solve polynomial inequalities of degree 3 or greater.
Chapter 9 Section 5 9.5 Polynomial and Rational Inequalities Objectives 1 3 Solve quadratic inequalities. Solve polynomial inequalities of degree 3 or greater. Solve rational inequalities. Objective 1
More informationContinuity of Bçezier patches. Jana Pçlnikovça, Jaroslav Plaçcek, Juraj ç Sofranko. Faculty of Mathematics and Physics. Comenius University
Continuity of Bezier patches Jana Plnikova, Jaroslav Placek, Juraj Sofranko Faculty of Mathematics and Physics Comenius University Bratislava Abstract The paper is concerned about the question of smooth
More informationLecture 23: 6.1 Inner Products
Lecture 23: 6.1 Inner Products Wei-Ta Chu 2008/12/17 Definition An inner product on a real vector space V is a function that associates a real number u, vwith each pair of vectors u and v in V in such
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationA Simple Turbulence Closure Model
A Simple Turbulence Closure Model Atmospheric Sciences 6150 1 Cartesian Tensor Notation Reynolds decomposition of velocity: Mean velocity: Turbulent velocity: Gradient operator: Advection operator: V =
More informationComputing the Hausdorff Distance between Two B-Spline Curves. Zachi Shtain
Computing the Hausdorff Distance between Two B-Spline Curves Zachi Shtain Based on the work of: Chen et al. 2010 Definition Given two curves C 1, C 2, their Hausdorff distance is defined as: H Where:,
More informationBé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 informationFind two positive factors of 24 whose sum is 10. Make an organized list.
9.5 Study Guide For use with pages 582 589 GOAL Factor trinomials of the form x 2 1 bx 1 c. EXAMPLE 1 Factor when b and c are positive Factor x 2 1 10x 1 24. Find two positive factors of 24 whose sum is
More informationCurvature variation minimizing cubic Hermite interpolants
Curvature variation minimizing cubic Hermite interpolants Gašper Jaklič a,b, Emil Žagar,a a FMF and IMFM, University of Ljubljana, Jadranska 19, Ljubljana, Slovenia b PINT, University of Primorska, Muzejski
More informationLecture 13 The Fundamental Forms of a Surface
Lecture 13 The Fundamental Forms of a Surface In the following we denote by F : O R 3 a parametric surface in R 3, F(u, v) = (x(u, v), y(u, v), z(u, v)). We denote partial derivatives with respect to the
More information3.2 Constructible Numbers
102 CHAPTER 3. SYMMETRIES 3.2 Constructible Numbers Armed with a straightedge, a compass and two points 0 and 1 marked on an otherwise blank number-plane, the game is to see which complex numbers you can
More informationIntrinsic Surface Geometry
Chapter 7 Intrinsic Surface Geometry The second fundamental form of a regular surface M R 3 helps to describe precisely how M sits inside the Euclidean space R 3. The first fundamental form of M, on the
More informationCHAPTER 3. Gauss map. In this chapter we will study the Gauss map of surfaces in R 3.
CHAPTER 3 Gauss map In this chapter we will study the Gauss map of surfaces in R 3. 3.1. Surfaces in R 3 Let S R 3 be a submanifold of dimension 2. Let {U i, ϕ i } be a DS on S. For any p U i we have a
More informationIntroduction 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 informationWeighted G 1 -Multi-Degree Reduction of Bézier Curves
Vol. 7, No. 2, 216 Weighted G 1 -Multi-Degree Reduction of Bézier Curves Abedallah Rababah Department of Mathematics, Jordan University of Science and Technology Irbid 2211 Jordan Salisu Ibrahim Department
More informationSuperconformal ruled surfaces in E 4
MATHEMATICAL COMMUNICATIONS 235 Math. Commun., Vol. 14, No. 2, pp. 235-244 (2009) Superconformal ruled surfaces in E 4 Bengü (Kılıç) Bayram 1, Betül Bulca 2, Kadri Arslan 2, and Günay Öztürk 3 1 Department
More information1 The Differential Geometry of Surfaces
1 The Differential Geometry of Surfaces Three-dimensional objects are bounded by surfaces. This section reviews some of the basic definitions and concepts relating to the geometry of smooth surfaces. 1.1
More informationM2R 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 informationMath 5378, Differential Geometry Solutions to practice questions for Test 2
Math 5378, Differential Geometry Solutions to practice questions for Test 2. Find all possible trajectories of the vector field w(x, y) = ( y, x) on 2. Solution: A trajectory would be a curve (x(t), y(t))
More informationCS 536 Computer Graphics NURBS Drawing Week 4, Lecture 6
CS 536 Computer Graphics NURBS Drawing Week 4, Lecture 6 David Breen, William Regli and Maxim Peysakhov Department of Computer Science Drexel University 1 Outline Conic Sections via NURBS Knot insertion
More informationConstruction of rational surface patches bounded by lines of curvature
Construction of rational surface patches bounded by lines of curvature Luc Biard Laboratoire Jean Kuntzmann, Université Joseph Fourier, Grenoble, FRANCE. Rida T. Farouki Department of Mechanical and Aeronautical
More informationChapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010
Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression
More informationCubic Helices in Minkowski Space
Cubic Helices in Minkowski Space Jiří Kosinka and Bert Jüttler Johannes Kepler University, Institute of Applied Geometry, Altenberger Str. 69, A 4040 Linz, Austria Abstract We discuss space like and light
More informationA Distance Property of the Feuerbach Point and Its Extension
Forum Geometricorum Volume 16 (016) 83 90. FOUM GEOM ISSN 1534-1178 A Distance Property of the Feuerbach Point and Its Extension Sándor Nagydobai Kiss Abstract. We prove that among the distances from the
More informationFMIA. Fluid Mechanics and Its Applications 113 Series Editor: A. Thess. Moukalled Mangani Darwish. F. Moukalled L. Mangani M.
FMIA F. Moukalled L. Mangani M. Darwish An Advanced Introduction with OpenFOAM and Matlab This textbook explores both the theoretical foundation of the Finite Volume Method (FVM) and its applications in
More informationLectures in Discrete Differential Geometry 2 Surfaces
Lectures in Discrete Differential Geometry 2 Surfaces Etienne Vouga February 4, 24 Smooth Surfaces in R 3 In this section we will review some properties of smooth surfaces R 3. We will assume that is parameterized
More informationBi-quartic parametric polynomial minimal surfaces
arxiv:1503.09159v1 [math.dg] 31 Mar 015 Bi-quartic parametric polynomial minimal surfaces Ognian Kassabov Abstract Krassimira Vlachkova Minimal surfaces with isothermal parameters admitting Bézier representation
More informationB.7 Lie Groups and Differential Equations
96 B.7. LIE GROUPS AND DIFFERENTIAL EQUATIONS B.7 Lie Groups and Differential Equations Peter J. Olver in Minneapolis, MN (U.S.A.) mailto:olver@ima.umn.edu The applications of Lie groups to solve differential
More informationCoordinate Systems. Recall that a basis for a vector space, V, is a set of vectors in V that is linearly independent and spans V.
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (rd edition). These notes are intended primarily for in-class presentation
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 12: Gauss for Linear Systems Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla
More informationVARIATIONAL INTERPOLATION OF SUBSETS
VARIATIONAL INTERPOLATION OF SUBSETS JOHANNES WALLNER, HELMUT POTTMANN Abstract. We consider the problem of variational interpolation of subsets of Euclidean spaces by curves such that the L 2 norm of
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 4: Changing Shapes: Linear Maps in 2D Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla
More informationMath 115 ( ) Yum-Tong Siu 1. Euler-Lagrange Equations for Many Functions and Variables and High-Order Derivatives
Math 115 006-007 Yum-Tong Siu 1 Euler-Lagrange Equations for Many Functions and Variables and High-Order Derivatives The Case of High-Order Derivatives. The context is to find the extremal for the functional
More informationElementary Linear Algebra
Elementary Linear Algebra Anton & Rorres, 10 th Edition Lecture Set 05 Chapter 4: General Vector Spaces 1006003 คณ ตศาสตร ว ศวกรรม 3 สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา 1/2554 1006003 คณตศาสตรวศวกรรม
More informationLecture 17: Section 4.2
Lecture 17: Section 4.2 Shuanglin Shao November 4, 2013 Subspaces We will discuss subspaces of vector spaces. Subspaces Definition. A subset W is a vector space V is called a subspace of V if W is itself
More informationA Simple Turbulence Closure Model. Atmospheric Sciences 6150
A Simple Turbulence Closure Model Atmospheric Sciences 6150 1 Cartesian Tensor Notation Reynolds decomposition of velocity: V = V + v V = U i + u i Mean velocity: V = Ui + V j + W k =(U, V, W ) U i =(U
More informationInvestigation of non-lightlike tubular surfaces with Darboux frame in Minkowski 3-space
CMMA 1, No. 2, 58-65 (2016) 58 Communication in Mathematical Modeling and Applications http://ntmsci.com/cmma Investigation of non-lightlike tubular surfaces with Darboux frame in Minkowski 3-space Emad
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More informationLINES IN P 3. Date: December 12,
LINES IN P 3 Points in P 3 correspond to (projective equivalence classes) of nonzero vectors in R 4. That is, the point in P 3 with homogeneous coordinates [X : Y : Z : W ] is the line [v] spanned by the
More informationORTHOGONALITY AND LEAST-SQUARES [CHAP. 6]
ORTHOGONALITY AND LEAST-SQUARES [CHAP. 6] Inner products and Norms Inner product or dot product of 2 vectors u and v in R n : u.v = u 1 v 1 + u 2 v 2 + + u n v n Calculate u.v when u = 1 2 2 0 v = 1 0
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
More informationVector Spaces ปร ภ ม เวกเตอร
Vector Spaces ปร ภ ม เวกเตอร 5.1 Real Vector Spaces ปร ภ ม เวกเตอร ของจ านวนจร ง Vector Space Axioms (1/2) Let V be an arbitrary nonempty set of objects on which two operations are defined, addition and
More informationMA 323 Geometric Modelling Course Notes: Day 20 Curvature and G 2 Bezier splines
MA 323 Geometric Modelling Course Notes: Day 20 Curvature and G 2 Bezier splines David L. Finn Yesterday, we introduced the notion of curvature and how it plays a role formally in the description of curves,
More informationCurves and Surfaces Represented by Support Function
Curves and Surfaces Represented by Support Function Zbyněk Šír Institute of Applied Geometry, JKU Linz (joint research with B. Jüttler and J. Gravesen) The research was supported through grant P17387-N12
More informationFastTrack - MA109. Exponents and Review of Polynomials
FastTrack - MA109 Exponents and Review of Polynomials Katherine Paullin, Ph.D. Lecturer, Department of Mathematics University of Kentucky katherine.paullin@uky.edu Monday, August 15, 2016 1 / 25 REEF Question
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationMTH 102A - Linear Algebra II Semester
MTH 02A - Linear Algebra - 205-6-II Semester Arbind Kumar Lal P. Vector space A set V over a field F is a vector space if x+y is defined in V for all x,y V and αx is defined in V for all x V,α F s.t. )
More informationComputing roots of polynomials by quadratic clipping
Computing roots of polynomials by quadratic clipping Michael Bartoň and Bert Jüttler Johann Radon Institute for Computational and Applied Mathematics, Austria Johannes Kepler University Linz, Institute
More informationA PROOF OF THE GAUSS-BONNET THEOREM. Contents. 1. Introduction. 2. Regular Surfaces
A PROOF OF THE GAUSS-BONNET THEOREM AARON HALPER Abstract. In this paper I will provide a proof of the Gauss-Bonnet Theorem. I will start by briefly explaining regular surfaces and move on to the first
More informationChapter 4. The First Fundamental Form (Induced Metric)
Chapter 4. The First Fundamental Form (Induced Metric) We begin with some definitions from linear algebra. Def. Let V be a vector space (over IR). A bilinear form on V is a map of the form B : V V IR which
More informationGeometric meanings of the parameters on rational conic segments
Science in China Ser. A Mathematics 005 Vol.48 No.9 09 09 Geometric meanings of the parameters on rational conic segments HU Qianqian & WANG Guojin Department of Mathematics, Zhejiang University, Hangzhou
More informationInterpolated Rigid-Body Motions and Robotics
Interpolated Rigid-Body Motions and Robotics J.M. Selig London South Bank University and Yuanqing Wu Shanghai Jiaotong University. IROS Beijing 2006 p.1/22 Introduction Interpolation of rigid motions important
More informationDierential Geometry Curves and surfaces Local properties Geometric foundations (critical for visual modeling and computing) Quantitative analysis Algo
Dierential Geometry Curves and surfaces Local properties Geometric foundations (critical for visual modeling and computing) Quantitative analysis Algorithm development Shape control and interrogation Curves
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More informationReview for Exam 2 Solutions
Review for Exam 2 Solutions Note: All vector spaces are real vector spaces. Definition 4.4 will be provided on the exam as it appears in the textbook.. Determine if the following sets V together with operations
More informationChapter 1: Systems of Linear Equations
Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where
More informationTest 1 Review Problems Spring 2015
Test Review Problems Spring 25 Let T HomV and let S be a subspace of V Define a map τ : V /S V /S by τv + S T v + S Is τ well-defined? If so when is it well-defined? If τ is well-defined is it a homomorphism?
More information12.3 Curvature, torsion and the TNB frame
1.3 Curvature, torsion and the TNB frame Acknowledgments: Material from a Georgia Tech worksheet by Jim Herod, School of Mathematics, herod@math.gatech.edu, is incorporated into the section on curvature,
More informationUNIVERSITY LIBRARY & TOWER, EDUATION BUILDING, LIBERAL ARTS ANNEX & UTILITY METERING VOL #3-
U V. (P) QUP. P. U WK. (P) P V. (P) W V. (P). P-. P-.. -. P-. P-. P- WK. st -/ P V #- 0 : /" = '-0" :. U W U P V W W P.. V U W W. U W P U W PW P. VU # U U. WK... QU U V JU.. W PP W U, U W Z # W. U U Z
More informationMath 497C Mar 3, Curves and Surfaces Fall 2004, PSU
Math 497C Mar 3, 2004 1 Curves and Surfaces Fall 2004, PSU Lecture Notes 10 2.3 Meaning of Gaussian Curvature In the previous lecture we gave a formal definition for Gaussian curvature K in terms of the
More information10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )
c Dr. Igor Zelenko, Fall 2017 1 10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections 7.2-7.4) 1. When each of the functions F 1, F 2,..., F n in right-hand side
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More informationLinear-Quadratic-Gaussian (LQG) Controllers and Kalman Filters
Linear-Quadratic-Gaussian (LQG) Controllers and Kalman Filters Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 204 Emo Todorov (UW) AMATH/CSE 579, Winter
More information