DOCSLIB.ORG

B-Spline and Subdivision P Surfaces

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
B-Spline and Subdivision P Surfaces B-Spline and Subdivision Surfaces Mirela Ben‐Chen Images from: 3drender.com & sunflow.sourceforge.net Today • B‐Spline surfaces – NURBS surfaces • Subdivision surfaces – Theory – Zoo • Recent trends – Non linear subdivision – T‐Splines 2 Images from: 3drender.com , sunflow.sourceforge.net , www.tsplines.com Reminder: Bezier & B‐Spline Curves Bezier Curve Cubic curve, 4 control points: Applet (Curves) AlApplet (Bas is fi)functions) 3 Reminder: Bezier & B‐Spline Curves B‐Splin e Curv e Decouple number of control points from degree of curve “Glue” a few degree p Bezier curves, with continuity conditions Applet (Curve) 4 Reminder: Bezier & B‐Spline Curves B‐Spline Curve P P Building blocks: 2 5 P6 P n + 1 control points Pi 1 P P P P 3 4 7 Knot vector U = { u0 , u1 , … , um } 0 The degree p m, n, p satisfy m = n + p -1 Applet (Basis functions) 5 Reminder: Bezier Surfaces Bezier surface ‐ tensor product surface of Bezier curves Control points of one curve move along a set of Bezier curves Applet 6 B‐Spline Surfaces A collection of Bezier patches, with continuity conditions Decoupling the degree and the number of control points 7 B‐Spline Surfaces B‐Splin e sur face ‐ tenso r pr oduct surface of B‐Spline curves Building blocks: Control net, m + 1 rows, n + 1 columns: Pij Knot vectors U = { u0 , u1 , … , uh }, V = { v0 , v1 , … , vk } The degrees p and q for the u and v direc tions 8 Basis Functions Cubic × Quadratic basis functions: 9 Boundary Knots In each direction, the B‐spline curve can be closed, clamped or open Closed Clamped Open 10 Properties • Non negativity • Partition of unity • Affine invariance 11 Properties • If n = pmp, m = q, U = { 0,…,0,1,…,1} and V = {0,…,0,1,…,1} then and S(u,v) is a Bezier surface • S(u,v) is Cp-k continuous in the u direction at a u knot of multiplicity k, and similar for v direction 12 Properties • Compact support • Local modification scheme – Moving Pij affects the surface only in the rectangle 13 Properties • Local definition – In any rectangle the only non‐zero basis functions are • Strong convex hull property – If then S(u,v) is in the convex hull of the control points Pij and 14 Reminder: NURBS Curves • B‐spline curves cannot represent exactly circles and ellipses p = 2 p = 3 p = 5 p = 10 • Generalize to rational ppyolynomials 15 Reminder: NURBS Curves A weight per control point allows to change the influence of a point on the curve, without moving the point 16 NURBS Surfaces Add a weight for every control point of a B‐ spline surface, and normalize Is not a tensor product patch 17 NURBS Surface Example Control net NURBS Surface wij( ) = 10, wij( ) = 1 18 NURBS Surfaces 19 Problems with NURBS • A single NURBS patch is either a topological disk, a tube or a torus • Must use many NURBS patches to model complex geometry • When deforming a surface made of NURBS patches, cracks arise at the seams 20 Subdivision “Subdivision defines a smooth curve or surface as the limit of a sequence of successive refinements” 21 Subdivision Rules • How the connectivity changes • How the ggyeometry changes – Old points – New points 22 Design Goals for Subd Rules • Efficiency • Compact support • Local definition Same properties NURBS have, but will work for • Affine invariance any topology • Simplicity • Smoothness 23 An Example – Loop Scheme • Connectivity 1/8 β β • Geometry 3/8 3/8 β β 1-kβ 1/8 β • Analysis? – Does it converge? – Is the limit surface smooth? – Any problems at extraordinary (valence != 6) vertices? 24 Parameterization of Subd Surfaces • B‐spline curves and surfaces are parameterized • To analyze subd schemes, we need a similar parameterization • Which domain to use? A planar rectangle cannot work • Solution: Use initial control mesh as the domain 25 Parameterization of Subd Surfaces • Apply subd rules to initial mesh, without updating the geometry • Use resulting polyhedron as the didomain 26 Definitions f j (|K|) K The domain polyhedron v A vertex of K |K| The surface of K as a subset of R3 pj (v) The control point corresponding pj (v) to v after j subd steps j j f (|K|) The subdivided mesh after subd v steps, as a piecewise linear function on |||K| K 27 Convergence • The subd surfaces are a sequence of linear maps ‐ f i :|K|→ R3 • The subd scheme converges uniformly to a lim it fifunction f if for all ε > 0, there exists n0 > 0, s.t. for all n > n0 28 Smoothness of Surfaces C1 continuity A surface f :|||K|→ R3 is C1 continuous if for every point x ∈ |K| there exists a regular parameterization π : D → f(Ux), over a unit disk D in the plane, where Ux is the neighborhood in |K| of x. A regular parameterization π is one that is continuously differentiable, one‐to‐one, and has a Jacobi matrix of maximum rank. 29 Smoothness of Surfaces Tangent Plane Continuity A surface f :|K|→ R3 is tangent plane continuous at x ∈ |K| if and only if surface normals are defined in a neighborhood around x, and there exists a limit of normals at x Tangent plane continuous, but not C1 continuous 30 Subdivision Properties • How can we prove properties of a subdivision scheme? • Express the subdivision as a local matrix operation • Prove properties (convergence, continuity, affine invariance, etc.) using eigen‐analysis. 31 1/8 β β 3/8 3/8 β β Subdivision Matrix 1-kβ 1/8 β • Look at the local neighborhood of an extraordinary vertex v • Let Uj be the set of vertices in the 2‐ring neighborhood of v after j Loop subdivision steps Step j Step j + 1 j • Let pi be the corresponding control points j+1 j • We can compute pi using only pi 32 Subdivision Matrix • An extraordinary vertex of degree k has vertices in its 2‐ring neighborhood k+3 2k+2 k+2 3 2 2k+3 2k+1 4 1 k+4 0 k+1 k 3k • S depends on k 2k 33 Subdivision Matrix • Assume S has a full set of eigenvectors {ϕi} with corresponding real eigenvalues {λi}, arranged in non‐increasing order • We can express p0 in terms of the eigenvectors of S: • Where: 34 Subdivision Matrix j • Now we can express p using only ai and the eigenvalues and eigenvectors of S: • We used the fact: 35 Subdivision Properties • Convergence: We need |λi| ≤ 1 for all i (and only one eigenvalue can be exactly 1) • Affine invariance: If for all A,B: For affine invariance we need → λ0 = 1 36 Subdivision Properties • Limit position: Since |λi| <1 for all i > 0, we have: In the limit the 2‐neighborhood of v is mapped to the same position: a0 We can compute the limit positions without recursively applying the subdivision 37 Subdivision Properties • Limit tangent plane: Since scheme is translation invariant, fix a0 = 0 Assume λ = λ1 = λ2 > λ3 For large enough j, the 2‐neighborhood of v is mapped to linear combinations of a1 and a2 a1 and a2 span the tangent plane of the limit surface at v 38 Piecewise Smooth Surfaces • So far, only considered closed smooth surfaces • Surfaces have boundaries and creases • A subdiv is ion scheme shldhould have rules for all the following cases: Smooth Convex Concave Interior Crease boundary boundary boundary 39 Subdivision Zoo • Can be classified according to: Primal (face split) Triangular meshes Quad Meshes Approximating Loop(C2) Catmull‐Clark(C2) Interpolating Mod. Butterfly (C1) Kobbelt (C1) Dual (vertex split) Doo‐Sabin, Midedge(C1) • Many more... Biquartic (C2) 40 Terminology • Regular vertices – Tri meshes • In the interior ‐ degree 6 • On the boundary –degree 4 – Quad meshes • In the interior ‐ degree 4 • On the boundary – degree 3 • Extraordinary vertices – all the rest 41 Terminology • Odd vertices – new vertices at current subdivision level • Even vertices – vertices inherited from previous level • Face vertices –odd vertices inserted in a face • Edge vertices –odd vertices inserted on an edge 42 Boundaries and Creases • Speci al subdivi si on ruesules will be gegiven for each scheme for the boundary vertices • The boundary curve of the limit surface: – Should not depend on interior control vertices • In case two surfaces will be merged along the boundary – Should be C1 or C2 • Use boundary rules for edges tagged as creases 43 Loop Scheme • Possible choices for β – Original (by Loop): – Or (by Warren): Odd vertices Even vertices 44 Loop Scheme • Limits for interior vertex v (using control points from any subd level j ) – Position – Tangents j Where vi for i = {0,..,k – 1} are the one ring neihbighbors of the j vertex v at subd level j, and pi are the corresponding control points 45 Modified Butterfly Scheme • Interpolating scheme – Even vertices don’t move Butterfly (not C1) Modified Butterfly 46 Catmull‐Clark Quad Scheme Can be modified to work on general polygons 47 Kobbelt Scheme Main observation ‐ to compute a face control point: • compute all edge control points • compute face control points using the edge rule applied to edge control points on same level 48 Scheme Comparison • Subdividing a cube – Loop result is assymetric, because cube was triangulated first – Both Loop and Catmull‐Clark are better then Butterfly (C2 vs. C1 ) – Interpolation vs. smoothness 49 Scheme Comparison • Subdividing a tetrahedron – Same insights – Severe shrinking for approximating schemes 50 Scheme Comparison • Spot the difference? • For smooth meshes with uniform triangle size, different schemes provide very similar results • Beware of interpolating schemes for control polygons with sharp features 51 So Who Wins? • Loop and Catmull‐Clark best when interpolation is not required • Loop best for triangular meshes • CtCatmu ll‐Clar k btbest for quad meshes – Don’t triangulate and then use Catmull‐Clark 52 The Dark Side of Subd Surfaces • Problems with curvature continuity – Requires either very large support, or forces 0 curvature at extraordinary vertices – Generates ripples near vertices of large degree 53 The Dark Side of Subd Surfaces • Decreased smoothness with degree – For large degg,rees, third eigenvalue approaches second and first eigenvalues – Generates creases • Can fix by modifying scheme – Creates more ripples 54 Beyond Subdivision Surfaces • Non‐linear subdivision [Schaefer et al.
Load more

Recommended publications
  • Math 541 - Numerical Analysis Interpolation and Polynomial Approximation — Piecewise Polynomial Approximation; Cubic Splines
    Polynomial Interpolation Cubic Splines Cubic Splines... Math 541 - Numerical Analysis Interpolation and Polynomial Approximation — Piecewise Polynomial Approximation; Cubic Splines Joseph M. Mahaffy, [email protected] Department of Mathematics and Statistics Dynamical Systems Group Computational Sciences Research Center San Diego State University San Diego, CA 92182-7720 http://jmahaffy.sdsu.edu Spring 2018 Piecewise Poly. Approx.; Cubic Splines — Joseph M. Mahaffy, [email protected] (1/48) Polynomial Interpolation Cubic Splines Cubic Splines... Outline 1 Polynomial Interpolation Checking the Roadmap Undesirable Side-effects New Ideas... 2 Cubic Splines Introduction Building the Spline Segments Associated Linear Systems 3 Cubic Splines... Error Bound Solving the Linear Systems Piecewise Poly. Approx.; Cubic Splines — Joseph M. Mahaffy, [email protected] (2/48) Polynomial Interpolation Checking the Roadmap Cubic Splines Undesirable Side-effects Cubic Splines... New Ideas... An n-degree polynomial passing through n + 1 points Polynomial Interpolation Construct a polynomial passing through the points (x0,f(x0)), (x1,f(x1)), (x2,f(x2)), ... , (xN ,f(xn)). Define Ln,k(x), the Lagrange coefficients: n x − xi x − x0 x − xk−1 x − xk+1 x − xn Ln,k(x)= = ··· · ··· , Y xk − xi xk − x0 xk − xk−1 xk − xk+1 xk − xn i=0, i=6 k which have the properties Ln,k(xk) = 1; Ln,k(xi)=0, for all i 6= k. Piecewise Poly. Approx.; Cubic Splines — Joseph M. Mahaffy, [email protected] (3/48) Polynomial Interpolation Checking the Roadmap Cubic Splines Undesirable Side-effects Cubic Splines... New Ideas... The nth Lagrange Interpolating Polynomial We use Ln,k(x), k =0,...,n as building blocks for the Lagrange interpolating polynomial: n P (x)= f(x )L (x), X k n,k k=0 which has the property P (xi)= f(xi), for all i =0, .
    [Show full text]
  • CHAPTER 6 Parametric Spline Curves
    CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic theory of spline functions and B-splines, and in Chapter 5 we studied a number of methods for constructing spline functions that approximate given data. In this chapter we return to spline curves and show how the approximation methods in Chapter 5 can be adapted to this more general situation. We start by giving a formal definition of parametric curves in Section 6.1, and introduce parametric spline curves in Section 6.2.1. In the rest of Section 6.2 we then generalise the approximation methods in Chapter 5 to curves. 6.1 Definition of Parametric Curves In Section 1.2 we gave an intuitive introduction to parametric curves and discussed the significance of different parameterisations. In this section we will give a more formal definition of parametric curves, but the reader is encouraged to first go back and reread Section 1.2 in Chapter 1. 6.1.1 Regular parametric representations A parametric curve will be defined in terms of parametric representations. s Definition 6.1. A vector function or mapping f :[a, b] 7→ R of the interval [a, b] into s m R for s ≥ 2 is called a parametric representation of class C for m ≥ 1 if each of the s components of f has continuous derivatives up to order m. If, in addition, the first derivative of f does not vanish in [a, b], Df(t) = f 0(t) 6= 0, for t ∈ [a, b], then f is called a regular parametric representation of class Cm.
    [Show full text]
  • Automatic Constraint-Based Synthesis of Non-Uniform Rational B-Spline Surfaces " (1994)
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1994 Automatic constraint-based synthesis of non- uniform rational B-spline surfaces Philip Chacko Theruvakattil Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mechanical Engineering Commons Recommended Citation Theruvakattil, Philip Chacko, "Automatic constraint-based synthesis of non-uniform rational B-spline surfaces " (1994). Retrospective Theses and Dissertations. 10515. https://lib.dr.iastate.edu/rtd/10515 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. INFORMATION TO USERS This manuscript has been reproduced from the microSlm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overlaps.
    [Show full text]
  • Interpolation & Polynomial Approximation Cubic Spline
    Interpolation & Polynomial Approximation Cubic Spline Interpolation I Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011 Brooks/Cole, Cengage Learning Piecewise-Polynomials Spline Conditions Spline Construction Outline 1 Piecewise-Polynomial Approximation 2 Conditions for a Cubic Spline Interpolant 3 Construction of a Cubic Spline Numerical Analysis (Chapter 3) Cubic Spline Interpolation I R L Burden & J D Faires 2 / 31 Piecewise-Polynomials Spline Conditions Spline Construction Outline 1 Piecewise-Polynomial Approximation 2 Conditions for a Cubic Spline Interpolant 3 Construction of a Cubic Spline Numerical Analysis (Chapter 3) Cubic Spline Interpolation I R L Burden & J D Faires 3 / 31 Piecewise-Polynomials Spline Conditions Spline Construction Piecewise-Polynomial Approximation Piecewise-linear interpolation This is the simplest piecewise-polynomial approximation and which consists of joining a set of data points {(x0, f (x0)), (x1, f (x1)),..., (xn, f (xn))} by a series of straight lines: y y 5 f (x) x0 x1 x2 . .xj xj11 xj12 . xn21 xn x Numerical Analysis (Chapter 3) Cubic Spline Interpolation I R L Burden & J D Faires 4 / 31 Piecewise-Polynomials Spline Conditions Spline Construction Piecewise-Polynomial Approximation Disadvantage of piecewise-linear interpolation There is likely no differentiability at the endpoints of the subintervals, which, in a geometrical context, means that the interpolating function is not “smooth.” Often it is clear from physical conditions that smoothness is required, so the approximating function must be continuously differentiable. We will next consider approximation using piecewise polynomials that require no specific derivative information, except perhaps at the endpoints of the interval on which the function is being approximated.
    [Show full text]
  • B-Spline Basics
    B(asic)-Spline Basics Carl de Bo or 1. Intro duction This essay reviews those basic facts ab out (univariate) B-splines which are of interest in CAGD. The intent is to give a self-contained and complete development of the material in as simple and direct a way as p ossible. For this reason, the B-splines are de ned via the recurrence relations, thus avoiding the discussion of divided di erences which the traditional de nition of a B-spline as a divided di erence of a truncated power function requires. This do es not force more elab orate derivations than are available to those who feel at ease with divided di erences. It do es force a change in the order in which facts are derived and brings more prominence to such things as Marsden's Identity or the Dual Functionals than they currently have in CAGD. In addition, it highlights the following point: The consideration of a single B-spline is not very fruitful when proving facts ab out B-splines, even if these facts (such as the smo othness of a B-spline) can be stated in terms of just one B-spline. Rather, simple arguments and real understanding of B-splines are available only if one is willing to consider al l the B-splines of a given order for a given knot sequence. Thus it fo cuses attention on splines, i.e., on the linear combination of B-splines. In this connection, it is worthwhile to stress that this essay (as do es its author) maintains that the term `B-spline' refers to a certain spline of minimal supp ort and, contrary to usage unhappily current in CAGD, do es not refer to a curve which happ ens to b e written in terms of B-splines.
    [Show full text]
  • B-Spline Polynomial
    Lecture 5: Introduction to B-Spline Curves 1 The control in shape change is better achieved with B-spline curves than the B´eziercurves. The degree of the curve is not dependent on the total number of points. B-splines are made out several curve segments that are joined \smoothly". Each such curve segment is controlled by a couple of consecutive control points. Thus, a change in the position of a control point only proapagates upto a predictable range. B-spline Polynomial Let p0; :::; pn be the control points. The nonrational form of a B-spline is given by n p(u) = Σi=0piNi;D(u) For B´eziercurves the number of control points determine the degree of the basis functions. For a B-spline curve a number D determines its degree which is D − 1. The basis functions are defined recursively as follows: Ni;1(u) = 1 if ti ≤ u < ti+1 = 0 otherwise and (u − ti)Ni;d−1(u) (ti+d − u)Ni+1;d−1(u) Ni;d(u) = + ti+d−1 − ti ti+d − ti+1 If the denominator of any of the two terms on the RHS is zero, we take that term to be zero. The range of d is given by d : d = 2; ::; d = D. The tj are called knot values, and a set of knots form a knot vector. If we have n control points and we want a B-spline curve of degree D − 1 we need T = n + D + 1 knots. If we impose the condition that the curve go through the end points of the control polygon, the knot values will be: tj = 0 if j < D tj = j − D + 1 if D ≤ j ≤ n tj = n − D + 2 if n < j ≤ n + D The knots range from 0 to n + D, the index i of basis functions ranges from 0 to n.
    [Show full text]
  • Lecture 19 Polynomial and Spline Interpolation
    Lecture 19 Polynomial and Spline Interpolation A Chemical Reaction In a chemical reaction the concentration level y of the product at time t was measured every half hour. The following results were found: t 0 .5 1.0 1.5 2.0 y 0 .19 .26 .29 .31 We can input this data into Matlab as t1 = 0:.5:2 y1 = [ 0 .19 .26 .29 .31 ] and plot the data with plot(t1,y1) Matlab automatically connects the data with line segments, so the graph has corners. What if we want a smoother graph? Try plot(t1,y1,'*') which will produce just asterisks at the data points. Next click on Tools, then click on the Basic Fitting option. This should produce a small window with several fitting options. Begin clicking them one at a time, clicking them off before clicking the next. Which ones produce a good-looking fit? You should note that the spline, the shape-preserving interpolant, and the 4th degree polynomial produce very good curves. The others do not. Polynomial Interpolation n Suppose we have n data points f(xi; yi)gi=1. A interpolant is a function f(x) such that yi = f(xi) for i = 1; : : : ; n. The most general polynomial with degree d is d d−1 pd(x) = adx + ad−1x + ::: + a1x + a0 ; which has d + 1 coefficients. A polynomial interpolant with degree d thus must satisfy d d−1 yi = pd(xi) = adxi + ad−1xi + ::: + a1xi + a0 for i = 1; : : : ; n. This system is a linear system in the unknowns a0; : : : ; an and solving linear systems is what computers do best.
    [Show full text]
  • Important Properties of B-Spline Basis Functions
    Important Properties of B-spline Basis Functions P2.1 Ni,p(u) = 0 if u is outside the interval [ui, ui+p+1) (local support property). For example, note that N1,3 is a combination of N1,0, N2,0, N3,0, and N4,0 Thus, N1,3 is non- ∈ zero only on the interval u [u1, u5]. ME525x NURBS Curve and Surface Modeling Page 124 N1,0 N0,2 N1,1 N0,3 N2,0 N1,2 N2,1 N1,3 N3,0 N2,2 N 3,1 N2,3 N4,0 N3,2 P2.2 In any given knot span, [uj, uj+1), at most p + 1 of the Ni,p are non-zero, namely, the functions: Nj-p,p, ..., Nj,p. ME525x NURBS Curve and Surface Modeling Page 125 For example, on [u3, u4) the only non-zero, 0-th degree function is N3,0. Hence the only cubic functions not zero on [u3, u4) are N0,3,..., N3,3. N1,1 N0,3 N2,0 N1,2 N2,1 N1,3 N3,0 N2,2 N3,1 N N 2,3 4,0 N3,2 N N4,1 3,3 ME525x NURBS Curve and Surface Modeling Page 126 ≥ P2.3 Ni,p(u) 0 for all i, p, and u (Non- negativity). Can be proven by induction using P2.1. P2.4 For arbitrary knot span, [ui, ui+1), i ∑ ( ) = 1 for all u ∈ [u , u ) Nj, p u i i+1 j = i – p (Partition of unity) ME525x NURBS Curve and Surface Modeling Page 127 P2.5 All derivatives of Ni,p(u) exist in the interior of a knot span (where it is a polynomial).
    [Show full text]
  • Bézier- and B-Spline Techniques
    B´ezier-and B-spline techniques Hartmut Prautzsch Wolfgang Boehm Marco Paluszny March 26, 2002 2 To Paul de Faget de Casteljau Preface Computer-aided modeling techniques have been developed since the advent of NC milling machines in the late 40’s. Since the early 60’s B´ezierand B- spline representations evolved as the major tool to handle curves and surfaces. These representations are geometrically intuitive and meaningful and they lead to constructive numerically robust algorithms. It is the purpose of this book to provide a solid and unified derivation of the various properties of B´ezierand B-spline representations and to show the beauty of the underlying rich mathematical structure. The book focuses on the core concepts of Computer-aided Geometric Design (CAGD) with the intent to provide a clear and illustrative presentation of the basic principles as well as a treatment of advanced material, including multivariate splines, some subdivision techniques and constructions of arbitrarily smooth free-form surfaces. In order to keep the book focused, many further CAGD methods are ex- cluded. In particular, rational B´ezierand B-spline techniques are not ad- dressed since a rigorous treatment within the appropriate context of projec- tive geometry would have been beyond the scope of this book. The book grew out of several courses taught repeatedly at the graduate and intermediate under-graduate levels by the authors at the Rensselaer Poly- technic Institute, USA, the Universities of Braunschweig and Karlsruhe, Ger- many, and the Universidad Central de Venezuela. These courses were taught as part of the curricula in mathematics and computer sciences, and they were regularly attended also by students from electrical and mechanical engineer- ing, geophysics and other sciences.
    [Show full text]
  • Hermite and Spline Interpolation Algorithms for Planar & Spatial
    Hermite and spline interpolation algorithms for planar & spatial Pythagorean-hodograph curves Rida T. Farouki Department of Mechanical & Aeronautical Engineering, University of California, Davis — synopsis — • motivation for Hermite & spline interpolation algorithms • planar PH quintic Hermite interpolants (four solutions) • computing absolute rotation index & elastic bending energy • a priori identification of “good” Hermite interpolant • planar C2 PH quintic splines — numerical methods • spatial PH quintic Hermite interpolants (2 free parameters) • spatial PH quintics — taxonomy of special types • spatial C2 PH quintic splines — residual freedoms motivation for Hermite & spline interpolation algorithms • only cubic PH curves characterizable by simple constraints on Bezier´ control polygons • planar PH cubics = Tschirnhausen’s cubic, spatial PH cubics = { helical cubic space curves } — too limited for general free–form design applications • construct quintic PH curves “geometrically” by interpolation of discrete data — points, tangents, etc. • non–linear interpolation equations made tractable by complex number model for planar PH curves, and quaternion or Hopf map model for spatial PH curves • efficient algorithms allow interactive design of PH curves Pythagorean triples of polynomials x0(t) = u2(t) − v2(t) x02(t) + y02(t) = σ2(t) ⇐⇒ y0(t) = 2 u(t)v(t) σ(t) = u2(t) + v2(t) K. K. Kubota, Pythagorean triples in unique factorization domains, American Mathematical Monthly 79, 503–505 (1972) R. T. Farouki and T. Sakkalis, Pythagorean hodographs, IBM Journal of Research and Development 34 736–752 (1990) R. T. Farouki, The conformal map z → z2 of the hodograph plane, Computer Aided Geometric Design 11, 363–390 (1994) complex number model for planar PH curves choose complex polynomial w(t) = u(t) + i v(t) → planar Pythagorean hodograph r0(t) = (x0(t), y0(t)) = w2(t) planar PH quintic Hermite interpolants R.
    [Show full text]
  • 1 Cubic Hermite Spline Interpolation
    cs412: introduction to numerical analysis 10/26/10 Lecture 13: Cubic Hermite Spline Interpolation II Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore 1 Cubic Hermite Spline Interpolation Recall in the last lecture we presented a special polynomial interpolation problem. Problem 1.1. Given an interval [L, R] and a function f :[L, R] → R, find the cubic polynomial p ∈ Π3 with p(L) = f(L) p(R) = f(R) p0(L) = f 0(L) p0(R) = f 0(R) Recall that we found a solution to problem 1.1 of the form: 2 2 p(t) =a ˜1(t − L) (t − R) +a ˜2(t − L) +a ˜3(t − L) +a ˜4 (1) Last time we saw that we can bound the error on p for t ∈ [L, R] using: ° ° °f (4)° |E(t)| ≤ ∞,[L,R] · (R − L)4 384 To approximate a function f over an interval [a, b], we can split the interval [a, b] into N subintervals using partition points ~x = (x0, x1, . , xN ), and solve problem 1.1 for every subinterval [xi, xi+1]. More formally, we can define the following cubic Hermite spline interpolation problem. Problem 1.2 (Cubic Hermite Spline Interpolation). Given an interval [a, b], a function f :[a, b] → 0 R, with derivative f :[a, b] → R, and a set of partition points ~x = (x0, x1, . , xN ) with a = x0 < x1 < ··· < xN = b, find a set of polynomials p0, p1, . , pN−1 (a cubic Hermite spline) with pi(xi) = f(xi) pi(xi+1) = f(xi+1) 0 0 pi(xi) = f (xi) 0 0 pi(xi+1) = f (xi+1) for i = 0, 1,...,N − 1.
    [Show full text]
  • Hermite Cubic Splines Basis Functions for Cubic Splines
    Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 18 Notes These notes correspond to Sections 11.5 and 11.6 in the text. Hermite Cubic Splines We have seen that it is possible to construct a piecewise cubic polynomial that interpolates a 2 function f(x) at knots a = x0 < x1 < ⋅ ⋅ ⋅ < xn = b, that belongs to C [a; b]. Now, suppose that we also know the values of f 0(x) at the knots. We wish to construct a piecewise cubic polynomial s(x) that agrees with f(x), and whose derivative agrees with f 0(x) at the knots. This piecewise polynomial is called a Hermite cubic spline. Because s(x) is cubic on each subinterval [xi−1; xi] for i = 1; 2; : : : ; n, there are 4n coefficients, and therefore 4n degrees of freedom, that can be used to satisfy any criteria that are imposed on s(x). Requiring that s(x) interpolates f(x) at the knots, and that s0(x) interpolates f 0(x) at the knots, imposes 2n + 2 constraints on the coefficients. We can then use the remaining 2n − 2 degrees of freedom to require that s(x) belong to C1[a; b]; that is, it is continuously differentiable on [a; b]. The following result provides insight into the accuracy with which a Hermite cubic spline inter- polant s(x) approximates a function f(x). (4) Theorem Let f be four times continuously differentiable on [a; b], and assume that kf k1 = M. Let s(x) be the unique Hermite cubic spline interpolant of f(x) on the nodes x0; x1; : : : ; xn, where a = x0 < x1 < ⋅ ⋅ ⋅ < xn < b.
    [Show full text]