Subdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves
|
|
- Elwin Robertson
- 5 years ago
- Views:
Transcription
1 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, IEEE Abstract Fractals are famous both for their strange appearance for their odd geometric properties. The problem of modeling is very simple when one has mathematical description of the fractal he wants to model. A set of transformations that generates a fractal by iteration is called an iterated function systems (IFS). An iterated function system maps the corresponding fractal onto itself as a collection of smaller self-similar copies. Fractals are often defined as fixed points of iterated function systems because when applied to the fractal the transformations that generate a fractal do not alter the fractal. In this paper we are going to show that the parametric interval Bezier curves are indeed fractals if the four associated with the original interval Bezier curves are fractals. The four fixed Kharitonov's polynomials (four fixed Bezier curves) associated with the original parametric interval Bezier curve are obtained. Iterated function systems (IFS) for the four are constructed so that starting with any compact set, not ust the four control polygons, iterating the transformations, the resulting sets converge in the limit to the given four fixed Kharitonov's polynomials (four fixed Bezier curves) curves. The transformation matrices in the iterated function systems are constructed to mimic the subdivision procedure, so there is indeed a deep connection between subdivision algorithms fractal procedures. The fixed control points that subdivide the four curves into two four fixed Kharitonov's polynomials (four fixed Bezier curves) curves are affine combinations of the original four control points. Thus we can represent the four fixed Kharitonov's polynomials (four fixed Bezier curves) subdivision by two square matrices whose entries are the coefficients in these affine combinations. A numerical example is included in order to demonstrate the effectiveness of the proposed method. Index Terms Subdivision matrices, iterated function systems, interval Bezier curve, CAGD. I. INTRODUCTION Parametric representations are widely used since they allow considerable flexibility for shaping design. In computer aided design geometric modeling, there are considerable interests in approximating curves surfaces with simpler forms of curves surfaces. Parametric Bezier curves are interactive. It is possible to control the shape of the Bezier curve by moving the control points by smoothly connecting individual segments. The Bezier curve possesses a characteristic intuitiveness in expressing the desired shape through property of convexity of control polygon. Interestingly during the same time, de Castelau too adopted Bernstein Basis for his work which was The author is with Department of Computer Engineering, Faculty of Electrical Electronic Engineering, University of Aleppo, Aleppo, ( oismail@ieee.org). focused on the property of non-negativity partition of unity of the basis function associated with the control points. Subdivision of the Bezier curve is required to break the curve into number of small segments for various applications like curve fitting, segmentation, interpolation, so. Besides some key Bernstein basis properties that constraints the behavior of Bezier curve like symmetry, recursion, nonnegativity, unity of partition, unimodality, relation to monomial basis, lower upper bounds, variation diminishing property, derivatives integrals there are some algorithms based properties like degree elevation, degree reduction composition that have consistently been evaluated analyzed over a period of decades in order to broaden its applications. There are several kinds of polynomial curves in CAGD, e.g., Bezier [], [], [3], [4] Said-Ball [5], Wang-Ball [6], [7], [8], B-spline curves [9] DP curves [0], []. These curves have some common different properties. All of them are defined in terms of the sum of product of their blending functions control points. They are ust different in their own basis polynomials. In order to compare these curves, we need to consider these properties. The common properties of these curves are control points, weights, their number of degrees. Control points are the points that affect to the shape of the curve. Weights can be treated as the indicators to control how much each control point influences to the curve. Number of degree determines the maximum degree of polynomials. In different curves, these properties are not computed by the same method. To compare different kinds of curves we need to convert these curves into an intermediate form. A parametric interval Bezier curve [-8] is a Bezier curve whose control points are rectangles (the sides of which are parallel to coordinate axis) in a plane. The control points that subdivide a Bezier curve into two Bezier curves are affine combinations of the original Bezier control points. Thus we can represent Bezier subdivision by two square matrices whose entries are the coefficients in these affine combinations. Fractals are always associated with obects that have strange pathological properties. Taking into account that fact the one that linear segments can also be constructed using suitable (IFS). Fractals are identified with attractors of some contractive mappings because such identification is the best one from the computer graphics point of view. Indeed, the mappings give us some coefficients which are commonly IJVIPNS-IJENS April 07 IJENS
2 International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 used in image coding. Fractals are attractors-fixed points of iterated function systems (IFS) [9], [0], []. The fractal methods became very important tools in many disciplines found very wide practical applications e.g., image compression, generating shore lines, mountains, clouds, pattern recognition, image processing, computer graphics or in medicine economy. In computer graphics, there is a need for succinct description of a complex obect s geometry an efficient way to vary the geometry of an obect to make movies. [] associated with the original parametric interval Bezier curve are: P n (u) = p 0 B n 0 (u) + p B n (u) + p + B n (u) + p + 3 B n 3 (u) + p 4 B n 4 (u) + p 5 B n 5 (u) + α 0,n B n 0 (u) + α,n B n (u) + α,n B n (u) + + α n,n B n n (u) P n (u) = p 0 B n 0 (u) + p + B n (u) + p + B n (u) + p 3 B n 3 (u) + p 4 B n 4 (u) + p + 5 B n 5 (u) + α 0,n B n 0 (u) + α,n B n (u) + α,n B n (u) + + α n,n B n n (u) In this paper it has been shown that if the four fixed Kharitonov's polynomials (four fixed Bezier curves) associated with the original parametric interval Bezier curve are fractals; then the given parametric interval Bezier curve is fractal. This paper is organized as follows. Section II contains the basic results, whereas section III shows a numerical example, the final section offers conclusions. II. THE BASIC RESULTS Parametric interval Bezier curves are segments of parametric interval polynomial curves. Each piece of a parametric interval polynomial curve is ust like any other piece of a parametric interval polynomial curve, so each segment of a parametric interval Bezier curve is itself a parametric interval Bezier curve. Thus, parametric interval Bezier curves are self-similar. Therefore, even though the parametric interval Bezier curves are infinitely differentiable, the interval Bezier curves are also fractal interval curves. Let {[p i, p + n i ]} be a given set of interval control points which defines the interval Bezier curve: n P I n (u) = [p i, p + i ] B n i (u) n = ([x i, x + i ], [y i, y + i ]) B n i (u) 0 u () of degree n where {B n n k (u)} k=0 are Bernstein polynomials formed by: P 3 n (u) = p + 0 B n 0 (u) + p + B n (u) + p B n (u) + p 3 B n 3 (u) + p + 4 B n 4 (u) + p + 5 B n 5 (u) + α 3 0,n B n 0 (u) + α 3,n B n (u) + α 3,n B n (u) + + α 3 n,n B n n (u) P 4 n (u) = p + 0 B n 0 (u) + p B n (u) + p B n (u) + p + 3 B n 3 (u) + p + 4 B n 4 (u) + p 5 B n 5 (u) + α 4 0,n B n 0 (u) + α 4,n B n (u) + α 4,n B n (u) + + α 4 n,n B n n (u) (3) The four fixed Kharitonov's polynomials (four fixed Bezier curves) can be written as follows: n P n (u) = α i,n B i n (u) for all u [0,] ( =,,3,4) (4) The de Castelau evaluation algorithm for the four fixed Kharitonov's polynomials (four fixed Bezier curves) is also a subdivision procedure, if we run the de Castelau evaluation algorithm at the midpoint of the parameter interval [a, b], then the fixed control points of the four fixed Kharitonov's polynomials (four fixed Bezier curves) that subdivide the four at u = (a + b) emerge along the left right lateral edges of the de Castelau triangle as shown below in Figure. Moreover, the labels along each edge in this triangle are, independent of the choice of the parameter interval. Our initial goal is to develop explicit expressions for the fixed control points q 0, q,, q n r 0, r,, r n of the four fixed Kharitonov's polynomials (four fixed Bezier curves) that subdivide the four fixed Kharitonov's polynomials (four fixed Bezier curves) of degree n in terms of the original control points α 0, α,, α n of the four fixed Kharitonov's polynomials (four fixed Bezier curves). Such formulas are easy to find. B k (u) = ( k ) ( u)( k) u k, (k = 0,,, ) () ( k ) =! k! ( k)! q q q 3 r0 r r is a binomial coefficient. q0 0 3 r 3 The sufficient condition for the given parametric interval Bezier curves to be fractals is that the four fixed Kharitonov's polynomials (four fixed Bezier curves) associated with the parametric interval Bezier curve should be fractals. Now the interval Bezier curve P n I (u) for u [0,] is fractal, if the four P n (u) for u [0,] =,,3,4 are fractals. The four α n k Fig. : The de Castelau subdivision algorithm for the four fixed Kharitonov's polynomials (four fixed Bezier curves) for =,,3,4. In general, since all the paths from α k to q l from to r n l are identical: IJVIPNS-IJENS April 07 IJENS
3 International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 3 { q l = l l p(l, m)α m r n l m=0 l = l p(l, m)α n m m=0 } ( =,,3,4) where p(l, m) is the number of paths from α m to q l or equivalently from α n m to r n l. But the number of paths from the m th position at the base to the apex of a triangle is the same as the number of paths from the apex to the m th position at the base of a triangle. The number of paths from the apex to any node in a triangle is given by the values in the nodes of Pascal s triangle that is, by binomial coefficients. Therefore, p(l, m) = ( l ), so m { q l = l l ( l m ) α m r n l m=0 l = l ( l m ) α n m m=0 ( =,,3,4), l = 0,,, n, l = 0,,, n } (5) (6) Using Equation (6), we can represent the fixed points q 0, q,, q n r 0, r,, r n that subdivide the four fixed Kharitonov's polynomials (four fixed Bezier curves) using matrix multiplication. Let H(n) be the (n + ) (n + ) matrix defined by: ( =,,3,4) (8) We can split H(n) into two square (n + ) (n + ) matrices L(n) R(n), where L(n) consists of the first (n + ) rows R(n) the last (n + ) rows of H(n). Thus, ( l L(n) = = m ) l n [ n n n] (l, m = 0,,, n) ( =,,3,4) n n n n R(n) = 0 n n l ( n = n m ) n l [ 0 0 ] (l, m = 0,,, n) ( =,,3,4) (9) (0) where, the matrices L(n) R(n), represent left right subdivision for the four fixed Kharitonov's polynomials (four fixed Bezier curves). H(n) = n n n n 0 n n [ 0 0 ] ( =,,3,4) Then, using equation (6), we can write: α 0 H(n) α = [ α n ] [ q 0 q q n = r 0 r r n ] (7) Therefore, we can write: IJVIPNS-IJENS April 07 IJENS 0 0 α 0 α 0 q 0 0 α α q L(n) = = [ α n n ] [ n n n] [ α n ] [ q n ] ( =,,3,4) () n α 0 n n n α 0 r 0 α α R(n) = 0 n r n = [ α n ] [ α [ 0 0 ] n ] [ r n ] ( =,,3,4) () Thus L(n) R(n) can be used to subdivide the four. We notice that L(n) R(n) share a common row: the last
4 International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 4 row of L(n) is the same as the first row of R(n) because q n = r n. Starting with the original four fixed Kharitonov's polynomials (four fixed Bezier curves) control points applying these matrices repeatedly generates a sequence of fixed control polygons that converge to the original four fixed Kharitonov's polynomials (four fixed Bezier curves) [3], [4]. [α 0 Suppose, however, that the matrices α = α α n ] T are invertible. Let L p (n) = [α ] L(n) α { R p (n) = [α ] R(n) α } (3) ( =,,3,4) Then, α L p (n) = α ([α ] L(n) α ) = L(n) α { α R p (n) = α ([α ] R(n) α ) = R(n) α } ( =,,3,4) (4) Moreover, iterating the transformations L p (n) R p (n) multiplying now on the right instead of on the left generates the same sequence of four fixed Kharitonov's polynomials (four fixed Bezier curves) control polygons as iterating the matrices L(n) R(n) on the control polygons α for ( =,,3,4). But, this is the key point, it is easy to show that the matrices L p (n) R p (n), represent contractive maps. Therefore {L p (n), R p (n)} for ( =,,3,4) are iterated function systems, so we can start with any compact set the iteration will still converge to the four fixed Kharitonov's polynomials (four fixed Bezier curves) with fixed control points α 0, α,, α n for ( =,,3,4). For the four fixed Kharitonov's polynomials (four fixed Bezier curves) of degree n, the subdivision matrices L(n) R(n), are (n + ) (n + ) matrices. To form the matrices L p (n) R p (n) for ( =,,3,4) the coordinates of the four fixed Kharitonov's polynomials (four fixed Bezier curves) control points α = [α 0 α α n ] T must constitute invertible (n + ) (n + ) matrices. If the fixed points α 0, α,, α n lie in an n dimensional affine space, then we can use homogeneous coordinates to form (n + ) (n + ) matrices. α = [ α 0 α α n ] ( =,,3,4) (5) The matrices α for ( =,,3,4) are then invertible precisely when the fixed points α 0, α,, α n are affinely independent. Typically, however, the degree n of the four is larger than the dimension d of the ambient space of the fixed control points. For example, for planar cubic curves, T n = 3 but d =. Nevertheless, in general, we can still form the matrices L p (n) R p (n), by lifting the fixed control points α = [α 0 dimensions IJVIPNS-IJENS April 07 IJENS α α n ] T to higher For planar four fixed Kharitonov's polynomials (four fixed Bezier curves), we can proceed in the following fashion. Let (x k, y k ) for ( =,,3,4) be the rectangular coordinates of α k, for k = 0,,, n. Then we can lift α to higher dimensions by introducing homogeneous coordinates lifting each four fixed Kharitonov's polynomials (four fixed Bezier curves) control point α k to dimension k, 3 k n, by annexing zeroes ones to the coordinates of α k for ( =,,3,4) k = 0,,, n. For example, for cubics we introduce one additional coordinate set: α = [ α 0 α α α = x 0 x x ] [ ( =,,3,4) x 3 y 0 y y y ] (6) for quartics we introduce two additional coordinates set: α x 0 y α = [ α α α 3 α = x x x 3 ] [ ( =,,3,4) x 4 y y y 3 y ] (7) so on. We notice that in each case, the matrix α is invertible if: α 0 det [ α α ] 0 ( =,,3,4) (8) Thus, α is invertible if the points α 0, α, α, are affinely independent; that is, if the points α 0, α, α, are not collinear. Of course, we could choose any other three non collinear fixed control points this lifting technique would work equally well. To generate the arbitrary degree n four fixed Kharitonov's polynomials (four fixed Bezier curves) using the iterated function systems {L p (n), R p (n)} for ( =,,3,4), we can now proceed in the following way: (i) lift the four fixed Kharitonov's polynomials (four fixed Bezier curves) control points α from the ambient affine space of dimension d to the ambient affine space of dimension n ; (ii) generate the corresponding higher dimensional four fixed Kharitonov's polynomials (four fixed Bezier curves) using the iterated function systems {L p (n), R p (n)} for ( =,,3,4);
5 International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 5 (iii) proect the resulting n dimensional four fixed Kharitonov's polynomials (four fixed Bezier curves) orthogonally back down to the original dimension d. III. NUMERICAL EXAMPLE Consider the case of quadratic parametric interval Bezier curve P I (u) for 0 u. P I (u) = [p i, p + i ] B i (u) = ([x i, x + i ], [y i, y + i ]) B i (u) 0 u Here, n =, so the subdivision matrices L() R() are 3 3 matrices, which at least are the right size matrices for generating fractals in the plane. As explained in section II the matrices L() R() are obtained as follows: 0 0 L() = , R() = 0 [ 4 4 4] [ 0 0 ] Unfortunately, it is not clear what happens to an arbitrary point when we multiply by these matrices on the right. But suppose that instead of the matrices L() R(), we let: α = [ α 0 α α ] = [ x 0 x ( =,,3,4) x y 0 y y ] be the matrices of the four fixed Kharitonov's polynomials (four fixed Bezier curves) control points we consider the matrices: L p () = [α ] L () α { R p () = [α ] R () α } ( =,,3,4) Applying these matrices to the four fixed Kharitonov's polynomials (four fixed Bezier curves) control points α on the right yields: α L p () = α ([α ] L() α ) = L() α { α R p () = α ([α ] L() α ) = R() α } ( =,,3,4) Furthermore, if we iterate this procedure by continuing to apply the matrices L p () R p () on the right, then we get exactly the same points that are generated by applying the matrices L() R() to the four fixed Kharitonov's polynomials (four fixed Bezier curves) control polygons α on the left. Thus the fixed points generated by applying the matrices L p () R p () on the right to the four fixed Kharitonov's polynomials (four fixed Bezier curves) control points α converge to the four fixed Kharitonov's polynomials (four fixed Bezier curves) for the control points α IJVIPNS-IJENS April 07 IJENS. The matrices L p () R p () represent affine transformations, since the third column in both matrices is [0 0 ] T. because [ ] T is the last column of α, it follows that: 0 [α ] [ ] = [ 0] ( =,,3,4) L() [ ] = [ ] R() [ ] = [ ] { } Therefore, the last column of both L p () R p () is [0 0 ] T because: 0 [α ] L() [ ] = [α ] [ ] = [ 0] 0 [α ] R() [ ] = [α ] [ ] = [ 0] { ( =,,3,4) } The matrices {L p (), R p ()} for ( =,,3,4) form an iterated function systems. The eigenvalues of L() R() are.00, 0.50, 0.5, so the matrices L p () R p (), which are similar to L() R() therefore have the same eigenvalues. (The eigenvalue corresponds to translationthat is, to the column [0 0 ] T, so it is only necessary to consider the other two eigenvalues; that is, the eigenvalues of the upper submatrices of L p () R p ()). The limit curve in this case the quadratic four fixed Kharitonov's polynomials (four fixed Bezier curves) are fractals! Using the iterated function systems, we can start with any compact set still converge to the same fixed points. Thus we are no longer constrained to start the iteration with the four fixed Kharitonov's polynomials (four fixed Bezier curves) control polygons. Since the quadratic four fixed Kharitonov's polynomials (four fixed Bezier curves) are fractals; the given quadratic parametric interval Bezier curve is fractal. IV. CONCLUSIONS In this paper it has been seen that the parametric interval Bezier curves are fractals. Fractals are attractors-fixed points of iterated function systems. A parametric interval Bezier curves are interval polynomials-linear combinations of Bernstein basis functions. It has been shown that if the four
6 International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 6 associated with the original parametric interval Bezier curve are fractals; then the given parametric interval Bezier curve is fractal. The four fixed Kharitonov's polynomials (four fixed Bezier curves) associated with the original parametric interval Bezier curve are obtained. The de Castelau subdivision algorithm is used to show that the four fixed Kharitonov's polynomials (four fixed Bezier curves) associated with the original parametric interval Bezier curve are also attractors. Subdivision has the look feel of a fractal procedure. In the stard fractal algorithm, we start with a compact set, iterate a collection of contractive transformations, converge in the limit to a fractal shape. In the four fixed Kharitonov's polynomials (four fixed Bezier curves) subdivision, we start with the four fixed Kharitonov's polynomials (four fixed Bezier curves) control polygons, iterate the de Castelau subdivision algorithm, converge in the limit to the four fixed Kharitonov's polynomials (four fixed Bezier curves) curves. The four fixed Kharitonov's polynomials (four fixed Bezier curves) subdivision can be represented by two square matrices whose entries are the coefficients in these affine combinations. Iterated function systems are constructed to generate polynomial piecewise polynomial curves built from these subdivision matrices. The proposed approach is based on proecting from higher dimensions, the control points are lift to higher dimensions then apply orthogonal proections. To construct the four fixed Kharitonov's polynomial (four fixed Bezier curves) curves using the iterated function systems {L p (n), R p (n)}, we start with any compact subset of n dimensional affine space iterate these transformations. The result is proected orthogonally into two dimensions. Since the coordinates behave independently under recursive subdivision since we do not change the x, y coordinates when we lift the control points to higher dimensions, these orthogonal proections converge to the four fixed Kharitonov's polynomials (four fixed Bezier curves). Thus, somewhat surprisingly, the four fixed Kharitonov's polynomials (four fixed Bezier curves). This means that the given parametric interval Bezier curve is fractal. REFERENCES [] P. Bezier, "Definition Numerique Des Courbes et Surfa ces I", Automatisme, Vol., pp , 966. [] P. Bezier, "Definition Numerique Des Courbes et Surfa ces II", Automatisme, Vol., pp. 7, 967. [3] P. Bezier, Numerical control, Mathematics Applications, New York: Wiley, 97. [4] P. Bezier, The Mathematical Basis of the UNISURF CAD System, Butterworth, London, 986. [5] H. B. Said, "A generalized Ball curve its recursive algorithm", ACM. Transaction on Graphics, Vol. 8, No. 4, pp , 989. [6] A. A. Ball, CONSURF Part : Introduction to conic lofting tile, Computer Aided Design, Vol. 6, No. 4, pp , 974. [7] A. A. Ball, CONSURF Part : Description of the algorithms, Computer Aided Design, Vol. 7, No. 4, pp. 37 4, 975. [8] A. A. Ball, CONSURF Part 3: How the program is used, Computer Aided Design, Vol. 9, No., pp. 9, 977. [9] G. J. Wang, "Ball curve of high degree its geometric properties", Applied. Mathematics: A Journal of Chinese Universities Vol., pp. 6-40, 987. [0] J. Delgado J. M. Pena, A linear complexity algorithm for the Bernstein basis, Proceedings of the 003 International Conference on Geometric Modeling Graphics (GMAG 03), pp. 6 67, 003. [] J. Delgado J. M. Pena, "A shape preserving representation with an evaluation algorithm of linear complexity, Computer Aided Geometric Design, pp. -0, 003. [] O. Ismail," L Degree Reduction of Interval Bezier Curves", International Journal of Research Reviews in Computer Science (IJRRCS), Vol., No., pp. 4-46, 00. [3] O. Ismail, "Degree Elevation of Interval Bezier Curves Using Legendre- Bernstein Basis Transformations", International Journal of Video & Image Processing Network Security (IJVIPNS), Vol. 0, No. 6, pp. 6-9, 00. [4] O. Ismail, "Degree Elevation of Interval Bezier Curves", International Journal of Video & Image Processing Network Security (IJVIPNS), Vol. 3, No., pp. 8-, 03. [5] O. Ismail, "Reparametrization Subdivision of Interval Bezier Curves", International Journal of Video & Image Processing Network Security (IJVIPNS), Vol. 4, No. 4, pp. -6, 04. [6] O. Ismail, "A smooth Connection of Interval Bezier Curve Segments", International Journal of Video & Image Processing Network Security (IJVIPNS), Vol. 5, No. 4, pp. -5, 05. [7] O. Ismail, "Regularity of Interval Bezier Curves", International Journal of Video & Image Processing Network Security (IJVIPNS), Vol. 5, No. 6, pp. -4, 05. [8] O. Ismail, "Degree Reduction of Parametric Interval Bezier Curves", Proc., International Conference on Sciences of Electronic, Technologies of Information Telecommunications (SETIT 06), Hammamet, Tunisia, 06. [9] M. Barnsley, Fractals everywhere, (Second Edition), Academic Press, Boston, Mass., 993. [0] W. Kotarski A. Lisowska, On Bezier-fractal modeling of D shapes, International Journal of Pure Applied Mathematics, Vol. 4, No., pp. 9-30, 005. [] C. T. John, All Bezier curves are attractors of iterated function systems, New York Journal of Mathematics, Vol. 3, pp. 07-5, 007. [] V. L. Kharitonov, "Asymptotic stability of an equilibrium position of a family of system of linear differential equations", Differential 'nye Urauneniya, vol. 4, pp , 978. [3] R. Goldman, Pyramid algorithms: A dynamic programming approach to curves surfaces for geometric modeling, Morgan Kaufmann, San Francisco, 00. [4] J. Lane R. Riesenfeld, A theoretical development for the computer generation display of piecewise polynomial surfaces, IEEE Trans. on Pattern Anal. Mach. Intell., Vol., pp , 980. O. Ismail (M 97 SM 04) received the B. E. degree in electrical electronic engineering from the University of Aleppo, Syria in 986. From 987 to 99, he was with the Faculty of Electrical Electronic Engineering of that university. He has an M. Tech. (Master of Technology) a Ph.D. both in modeling simulation from the Indian Institute of Technology, Bombay, in , respectively. Dr. Ismail is a Senior Member of IEEE. Life Time Membership of International Journals of Engineering & Sciences (IJENS) Researchers Promotion Group (RPG). He is an Academic Member of the Athens Institute for Education Research, belonging to the Computer Research Unit the Electrical Engineering Research Unit. His main fields of research include computer graphics, computer aided analysis design (CAAD), computer simulation modeling, digital image processing, pattern recognition, robust control, modeling identification of systems with structured unstructured uncertainties. He has published more than 74 refereed international ournals conferences papers on these subects. In 997 he oined the Department of Computer Engineering at the Faculty of Electrical Electronic Engineering in University of Aleppo, Syria. In 004 he oined Department of Computer Science, Faculty of Computer Science Engineering, Taibah University, K.S.A. as an associate professor for six years. He has been chosen for inclusion in the special 5th Silver Anniversary Editions of Who s Who in the World. Published in Presently, he is working as a professor in Department of Computer Engineering at the Faculty of Electrical Electronic Engineering, University of Aleppo IJVIPNS-IJENS April 07 IJENS
A matrix Method for Interval Hermite Curve Segmentation O. Ismail, Senior Member, IEEE
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:15 No:03 7 A matrix Method for Interal Hermite Cure Segmentation O. Ismail, Senior Member, IEEE Abstract Since the use
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 informationInterpolation 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 informationMA 323 Geometric Modelling Course Notes: Day 12 de Casteljau s Algorithm and Subdivision
MA 323 Geometric Modelling Course Notes: Day 12 de Casteljau s Algorithm and Subdivision David L. Finn Yesterday, we introduced barycentric coordinates and de Casteljau s algorithm. Today, we want to go
More informationOn-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 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 informationComputergrafik. 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 informationCMSC427 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 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 informationIntroduction 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 informationCSE 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 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 informationArsè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 informationPrentice Hall CME Project, Algebra
Prentice Hall Advanced Algebra C O R R E L A T E D T O Oregon High School Standards Draft 6.0, March 2009, Advanced Algebra Advanced Algebra A.A.1 Relations and Functions: Analyze functions and relations
More informationCharacterization of Planar Cubic Alternative curve. Perak, M sia. M sia. Penang, M sia.
Characterization of Planar Cubic Alternative curve. Azhar Ahmad α, R.Gobithasan γ, Jamaluddin Md.Ali β, α Dept. of Mathematics, Sultan Idris University of Education, 59 Tanjung Malim, Perak, M sia. γ Dept
More informationLecture 20: Lagrange Interpolation and Neville s Algorithm. for I will pass through thee, saith the LORD. Amos 5:17
Lecture 20: Lagrange Interpolation and Neville s Algorithm for I will pass through thee, saith the LORD. Amos 5:17 1. Introduction Perhaps the easiest way to describe a shape is to select some points on
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
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 informationA Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves
A Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves David Eberly, Geometric Tools, Redmond WA 9852 https://www.geometrictools.com/ This work is licensed under the Creative
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 informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 informationApproximation 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 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 informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationAlgebra and Trigonometry
Algebra and Trigonometry 978-1-63545-098-9 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Jay Abramson, Arizona State
More informationFractals. R. J. Renka 11/14/2016. Department of Computer Science & Engineering University of North Texas. R. J. Renka Fractals
Fractals R. J. Renka Department of Computer Science & Engineering University of North Texas 11/14/2016 Introduction In graphics, fractals are used to produce natural scenes with irregular shapes, such
More informationFractals. Krzysztof Gdawiec.
Fractals Krzysztof Gdawiec kgdawiec@ux2.math.us.edu.pl 1 Introduction In the 1970 s Benoit Mandelbrot introduced to the world new field of mathematics. He named this field fractal geometry (fractus from
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationSmooth 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 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 informationCollege Algebra with Corequisite Support: Targeted Review
College Algebra with Corequisite Support: Targeted Review 978-1-63545-056-9 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
More informationSOLUTIONS: ASSIGNMENT Use Gaussian elimination to find the determinant of the matrix. = det. = det = 1 ( 2) 3 6 = 36. v 4.
SOLUTIONS: ASSIGNMENT 9 66 Use Gaussian elimination to find the determinant of the matrix det 1 1 4 4 1 1 1 1 8 8 = det = det 0 7 9 0 0 0 6 = 1 ( ) 3 6 = 36 = det = det 0 0 6 1 0 0 0 6 61 Consider a 4
More informationConstruction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 54 27 (79 95) Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions P. Bouboulis L. Dalla and M. Kostaki-Kosta Received
More informationGeometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves
Geometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves Gašper Jaklič a,c, Jernej Kozak a,b, Marjeta Krajnc b, Vito Vitrih c, Emil Žagar a,b, a FMF, University of Ljubljana, Jadranska
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 informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationCONTROL POLYGONS FOR CUBIC CURVES
On-Line Geometric Modeling Notes CONTROL POLYGONS FOR CUBIC CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview B-Spline
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 informationA video College Algebra course & 6 Enrichment videos
A video College Algebra course & 6 Enrichment videos Recorded at the University of Missouri Kansas City in 1998. All times are approximate. About 43 hours total. Available on YouTube at http://www.youtube.com/user/umkc
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationCollege Algebra To learn more about all our offerings Visit Knewton.com
College Algebra 978-1-63545-097-2 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Text Jay Abramson, Arizona State University
More informationCMSC 425: Lecture 12 Procedural Generation: Fractals
: Lecture 12 Procedural Generation: Fractals Reading: This material comes from classic computer-graphics books. Procedural Generation: One of the important issues in game development is how to generate
More informationCheck boxes of Edited Copy of Sp Topics (was 261-pilot)
Check boxes of Edited Copy of 10023 Sp 11 253 Topics (was 261-pilot) Intermediate Algebra (2011), 3rd Ed. [open all close all] R-Review of Basic Algebraic Concepts Section R.2 Ordering integers Plotting
More information290 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 informationAlgebra II Crosswalk. Red font indicates a passage that is not addressed in the compared sets of standards.
The chart below includes the assessed on the Algebra II California Test, the Mathematics ), the the, the Competencies in Mathematics from the Intersegmental Committee of the Academic Senate (ICAS), and
More informationCollege Algebra with Corequisite Support: A Blended Approach
College Algebra with Corequisite Support: A Blended Approach 978-1-63545-058-3 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
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 informationDRAFT. Pre-calculus Curriculum Map Quarter 1 Chapters P 2. Extraneous Critical numbers Test intervals
Quarter 1 Chapters P 2 Plot points in the coordinate plane and use distance and midpoint formulas. Sketch graphs of equations. Find and use slope of a line to write and graph linear equations. Solve equations:
More informationOn a Topological Problem of Strange Attractors. Ibrahim Kirat and Ayhan Yurdaer
On a Topological Problem of Strange Attractors Ibrahim Kirat and Ayhan Yurdaer Department of Mathematics, Istanbul Technical University, 34469,Maslak-Istanbul, Turkey E-mail: ibkst@yahoo.com and yurdaerayhan@itu.edu.tr
More informationMOMENT functions are used in several computer vision
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 13, NO. 8, AUGUST 2004 1055 Some Computational Aspects of Discrete Orthonormal Moments R. Mukundan, Senior Member, IEEE Abstract Discrete orthogonal moments
More informationPRECALCULUS BISHOP KELLY HIGH SCHOOL BOISE, IDAHO. Prepared by Kristina L. Gazdik. March 2005
PRECALCULUS BISHOP KELLY HIGH SCHOOL BOISE, IDAHO Prepared by Kristina L. Gazdik March 2005 1 TABLE OF CONTENTS Course Description.3 Scope and Sequence 4 Content Outlines UNIT I: FUNCTIONS AND THEIR GRAPHS
More informationNonstationary 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 informationIntermediate Algebra
Intermediate Algebra 978-1-63545-084-2 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable) Openstax Lyn Marecek, MaryAnne Anthony-Smith
More informationRational 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 informationBinomials defined, 13 division by, FOIL method and, 22 multiplying binomial by trinomial,
5639_Holtfrerich_Index 6/2/05 11:45 AM Page I-1 Index Absolute value defined, 46 functions and, 126 59 Absolute value equations, solutions, 46 49 Absolute value inequalities, solutions, 263 267 Acceleration,
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 informationSelf-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 informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More informationNondeterministic Kinetics Based Feature Clustering for Fractal Pattern Coding
Nondeterministic Kinetics Based Feature Clustering for Fractal Pattern Coding Kohji Kamejima Faculty of Engineering, Osaka Institute of Technology 5-16-1 Omiya, Asahi, Osaka 535-8585 JAPAN Tel: +81 6 6954-4330;
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 informationWhat Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both?
What Do Lattice Paths Have To Do With Matrices, And What Is Beyond Both? Joseph E. Bonin The George Washington University These slides are available at blogs.gwu.edu/jbonin Some ideas in this talk were
More informationA 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 informationIntegrated CME Project Mathematics I-III 2013
A Correlation of -III To the North Carolina High School Mathematics Math I A Correlation of, -III, Introduction This document demonstrates how, -III meets the standards of the Math I. Correlation references
More informationA Complete Stability Analysis of Planar Discrete-Time Linear Systems Under Saturation
710 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATIONS, VOL 48, NO 6, JUNE 2001 A Complete Stability Analysis of Planar Discrete-Time Linear Systems Under Saturation Tingshu
More informationUtah Secondary Mathematics Core Curriculum Precalculus
A Correlation of Trigonometry Lial To the Utah Secondary Mathematics Core Curriculum Precalculus Resource Title: Trigonometry Publisher: Pearson Education Inc Publishing as Prentice Hall ISBN (10 or 13
More informationRoss Program 2017 Application Problems
Ross Program 2017 Application Problems This document is part of the application to the Ross Mathematics Program, and is posted at http://u.osu.edu/rossmath/. The Admission Committee will start reading
More informationTennessee s State Mathematics Standards Precalculus
Tennessee s State Mathematics Standards Precalculus Domain Cluster Standard Number Expressions (N-NE) Represent, interpret, compare, and simplify number expressions 1. Use the laws of exponents and logarithms
More informationCheck boxes of Edited Copy of Sp Topics (was 217-pilot)
Check boxes of Edited Copy of 10024 Sp 11 213 Topics (was 217-pilot) College Algebra, 9th Ed. [open all close all] R-Basic Algebra Operations Section R.1 Integers and rational numbers Rational and irrational
More informationHigher Order Singularities in Piecewise Linear Vector Fields
Higher Order Singularities in Piecewise Linear Vector Fields Xavier Tricoche, Gerik Scheuermann, Hans Hagen Computer Science Department, University of Kaiserslautern, Germany Summary. Piecewise linear
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationCollege Algebra. Course Text. Course Description. Course Objectives. StraighterLine MAT101: College Algebra
College Algebra Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 9780072867381 [This text is available as an etextbook at
More informationConstruction of `Wachspress type' rational basis functions over rectangles
Proc. Indian Acad. Sci. (Math. Sci.), Vol. 110, No. 1, February 2000, pp. 69±77. # Printed in India Construction of `Wachspress type' rational basis functions over rectangles P L POWAR and S S RANA Department
More informationNovel 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 informationCollege Algebra with Corequisite Support: A Compressed Approach
College Algebra with Corequisite Support: A Compressed Approach 978-1-63545-059-0 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable)
More informationSingle Variable Calculus, Early Transcendentals
Single Variable Calculus, Early Transcendentals 978-1-63545-100-9 To learn more about all our offerings Visit Knewtonalta.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax
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 informationElementary and Intermediate Algebra
Elementary and Intermediate Algebra 978-1-63545-106-1 To learn more about all our offerings Visit Knewton.com Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Lynn Marecek, Santa
More informationAlgebra II Learning Targets
Chapter 0 Preparing for Advanced Algebra LT 0.1 Representing Functions Identify the domain and range of functions LT 0.2 FOIL Use the FOIL method to multiply binomials LT 0.3 Factoring Polynomials Use
More informationIdentify the graph of a function, and obtain information from or about the graph of a function.
PS 1 Graphs: Graph equations using rectangular coordinates and graphing utilities, find intercepts, discuss symmetry, graph key equations, solve equations using a graphing utility, work with lines and
More informationCGT 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 informationBinomial Convolutions and Derivatives Estimation from Noisy Discretizations
Binomial Convolutions and Derivatives Estimation from Noisy Discretizations Rémy Malgouyres 1, Florent Brunet 2,andSébastien Fourey 3 1 Univ. Clermont 1, LAIC, IUT Dépt Informatique, BP 86, F-63172 Aubière,
More informationCalculus I
Calculus I 978-1-63545-038-5 To learn more about all our offerings Visit Knewton.com/highered Source Author(s) (Text or Video) Title(s) Link (where applicable) OpenStax Gilbert Strang, Massachusetts Institute
More informationRepresentations of Sp(6,R) and SU(3) carried by homogeneous polynomials
Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials Govindan Rangarajan a) Department of Mathematics and Centre for Theoretical Studies, Indian Institute of Science, Bangalore 560 012,
More informationExtrapolation Methods for Approximating Arc Length and Surface Area
Extrapolation Methods for Approximating Arc Length and Surface Area Michael S. Floater, Atgeirr F. Rasmussen and Ulrich Reif March 2, 27 Abstract A well-known method of estimating the length of a parametric
More informationR1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member
Chapter R Review of basic concepts * R1: Sets A set is a collection of objects sets are written using set brackets each object in onset is called an element or member Ex: Write the set of counting numbers
More informationA PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS
#A INTEGERS 9 (9), 7-37 A PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS Shu-Juan Duan School of Math. and Computational Sciences, Xiangtan University, Hunan, China jjmmcn@6.com
More informationMULTIVARIABLE CALCULUS, LINEAR ALGEBRA, AND DIFFERENTIAL EQUATIONS
T H I R D E D I T I O N MULTIVARIABLE CALCULUS, LINEAR ALGEBRA, AND DIFFERENTIAL EQUATIONS STANLEY I. GROSSMAN University of Montana and University College London SAUNDERS COLLEGE PUBLISHING HARCOURT BRACE
More informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationLinear Algebra. and
Instructions Please answer the six problems on your own paper. These are essay questions: you should write in complete sentences. 1. Are the two matrices 1 2 2 1 3 5 2 7 and 1 1 1 4 4 2 5 5 2 row equivalent?
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
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 informationRigid Geometric Transformations
Rigid Geometric Transformations Carlo Tomasi This note is a quick refresher of the geometry of rigid transformations in three-dimensional space, expressed in Cartesian coordinates. 1 Cartesian Coordinates
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 28th, 2013 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the introductory
More informationINTRODUCTION TO FRACTAL GEOMETRY
Every mathematical theory, however abstract, is inspired by some idea coming in our mind from the observation of nature, and has some application to our world, even if very unexpected ones and lying centuries
More information1 Roots of polynomials
CS348a: Computer Graphics Handout #18 Geometric Modeling Original Handout #13 Stanford University Tuesday, 9 November 1993 Original Lecture #5: 14th October 1993 Topics: Polynomials Scribe: Mark P Kust
More information1 Differentiable manifolds and smooth maps. (Solutions)
1 Differentiable manifolds and smooth maps Solutions Last updated: March 17 2011 Problem 1 The state of the planar pendulum is entirely defined by the position of its moving end in the plane R 2 Since
More information