Arsène Pérard-Gayot (Slides by Piotr Danilewski)
|
|
- Griffin Harrison
- 5 years ago
- Views:
Transcription
1 Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski)
2 CURVES
3 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 = 0 Parametric f x t f t f y t f x, f y : R R f: R R 2 typically: t 0,1 γ = x, y : t R: f x t = x f y t = y x t = cos t y t = sin t t 0,2π
4 Polynomial curves Avoids complicated functions (e.g. pow, exp, sin, sqrt) Use simple polynomials of low degree Flexible, easy to use x t = a 0 + a 1 t + a 2 t 2 + a 3 t 3 + y t = b 0 + b 1 t + b 2 t 2 + b 3 t 3 + z t = c 0 + c 1 t + c 2 t 2 + c 3 t 3 + monomial degree P t = x t y t z t = n i=0 t i a i, b i, c i monomial basis P t = t n t n 1 1 a n b n c n a n 1 b n 1 c n 1 a 0 b 0 c 0 Coefficients R 3 n coordinates each coordinate is R 3
5 Derivatives angent vector P t = t n t n 1 t 1 a n b n c n a n 1 b n 1 c n 1 a 0 b 0 c 0 P t = nt n 1 n 1 t n a n b n c n a n 1 b n 1 c n 1 a 0 b 0 c 0
6 Continuity Continuity and smoothness between parametric curves γ 1, γ 2 : [0,1] R d γ 1 γ 1 γ 2 γ 2 Not continuous G 0 - C 0 -continuous γ 1 1 = γ 2 0
7 Continuity Continuity and smoothness between parametric curves γ 1, γ 2 : [0,1] R d γ 1 γ 2 γ 2 0 γ 1 1 γ 1 γ 1 1 γ 2 0 γ 2 G 1 -continuous G 0 + tangent vectors parallel γ 1 1 = pγ 2 0, p R + C 1 -continuous C 0 + tangent vectors parallel γ 1 1 = γ 2 0
8 Continuity Continuity and smoothness between parametric curves γ 1, γ 2 : [0,1] R d G 2 -continuous G 1 + γ 1 1 = pγ 2 0, p R + C 2 -continuous C 1 + γ 1 1 = γ 2 0 G 2 smooth reflections
9 LAGRANGE INERPOLAION
10 Lagrange Interpolation Given a set of points: t i, p i, t R, p i R d Find a polynomial P such that: i P t i = p i t 2, p 2 t 1, p 1 t 3, p 3
11 Lagrange Interpolation Given a set of n points: t i, p i, t R, p i R d Find a polynomial P such that: i P t i = p i For each point associate a Lagrange basis polynomial: t 2, p 2 L i n t = j j i t t j t i t j t 1, p 1 t 3, p 3 t 1, 0 t 3, 0 p 2 L 2 n t (i j) L n i t j = 0 L n i t i = 1
12 Lagrange Interpolation Given a set of n points: t i, p i, t R, p i R d Find a polynomial P such that: i P t i = p i For each point associate a Lagrange basis polynomial: t 2, p 2 L i n t = j j i t t j t i t j t 1, p 1 t 3, p 3 Add the Lagrange basis with points as weights: P t = i Lagrange basis n n n P t = L 0 L 1 L n 1 L n i t p i p 0 x p 0 y p 0 z p 1 x p 1 y p 1 z p n 1 x p n 1 y p n 1 z
13 Lagrange Interpolation Given a set of n points: t i, p i, t R, p i R d Find a polynomial P such that: i P t i = p i For each point associate a Lagrange basis polynomial: L i n t = j j i t t j t i t j Add the Lagrange basis with points as weights: Given 2 points L 0 2 t = t t 1 t 0 t 1 L 1 2 t = t t 0 t 1 t 0 P t = linear interpolation Given 3 points L 0 3 t = t t 1 t 0 t 1 t t 2 t 0 t 2 P t = quadratic interpolation P t = i p i L i n t
14 Problems Problems with a single polynomial Degree depends on the number of interpolation constraints Strong overshooting for high degree (n > 7) Problems with smooth joints Numerically unstable No local changes
15 SPLINES
16 Splines Functions for interpolation & approximation Standard curve and surface primitives in geometric modeling Key frame and in-betweens in animations Filtering and reconstruction of images Historically Name for a tool in ship building Flexible metal strip that tries to stay straight Within computer graphics: Piecewise polynomial function P t Q t R t S t
17 Linear Interpolation - Defined by two points: p 1, p 2 - Searching for P t such that: - P 0 = p 1 - P 1 = p 2 - Degree of P is 1 Basis: 1 t = 1 t 2 t = t t Linear basis P t = p 1 1 t + p 2 2 (t) P t = 1 t t p 1 p 2
18 Linear Interpolation monomial basis t 1 1 t t Linear basis P t = M p 1 p 2
19 Linear Interpolation P t = M p 1 p 2 C 0 -continuous
20 Cubic Hermite Interpolation - Defined by - two points: p 1, p 2 - two tangents: t 1, t 2 - Searching for P t such that: - P 0 = p 1 - P 0 = t 1 - P 1 = t 2 - P 1 = p 2 - Degree of P is 3 Basis: H 0 3 t =? H 1 3 t =? H 2 3 t =? H 3 3 t =?
21 Cubic Hermite Interpolation - Defined by - two points: p 1, p 2 - two tangents: t 1, t 2 - Searching for P t such that: - P 0 = p 1 - P 0 = t P 1 = t 2 P 1 = p 2 t 3 t 2 t 1 - Degree of P is 3 H 1 H 0 3 t H 1 3 t H 2 3 t H 3 3 t Basis: H H 0 3 t =? H 1 3 t =? H 2 3 t =? H 3 3 t =? P t = M H p 1 t 1 t 2 p 2 = M H G
22 Cubic Hermite Interpolation - Defined by - two points: p 1, p 2 - two tangents: t 1, t 2 - Searching for P t such that: - P 0 = p 1 - P 0 = t 1 - P 1 = t 2 - P 1 = p 2 - Degree of P is 3 P t = t 3 t 2 t 1 1 H G P t = 3t 2 2t 1 0 H G p 1 = P 0 = H G t 1 = P 0 = H G t 2 = P 1 = H G p 2 = P 1 = H G p 1 t 1 t 2 p 2 = H p 1 t 1 t 2 p 2
23 Cubic Hermite Interpolation - Defined by - two points: p 1, p 2 - two tangents: t 1, t 2 - Searching for P t such that: - P 0 = p 1 - P 0 = t 1 - P 1 = t 2 - P 1 = p 2 - Degree of P is 3 H = =
24 Cubic Hermite Interpolation - Defined by - two points: p 1, p 2 - two tangents: t 1, t 2 - Searching for P t such that: - P 0 = p 1 - P 0 = t 1 - P 1 = t 2 - P 1 = p 2 - Degree of P is 3 Basis: H 0 3 t = 1 t 2 (1 + 2t) H 1 3 t = t 1 t 2 H 2 3 t = t 2 t 1 H 3 3 t = 3 2t t 2 H = H 0 3 t H 1 3 t H 2 3 t H 3 3 t H 0 3 H 3 3 H 1 3 H 2 3
25 Cubic Hermite Interpolation G 1 -continuous C 1 -continuous
26 Bézier - Defined by - b 0 - start point - b 3 - end point - b 1, b 2 - control points that are approximated - Searching for P t such that: - P 0 = b 0 - P 0 = 3 b 1 b 0 - P 1 = 3 b 3 b 2 - P 1 = b 3 - Degree of P is 3
27 Bézier - Defined by - b 0 - start point - b 3 - end point - b 1, b 2 - control points that are approximated - Searching for P t such that: - P 0 = b 0 - P 0 = 3 b 1 b 0 - P 1 = 3 b 3 b 2 - P 1 = b 3 - Degree of P is 3 p 1 t 1 t 2 p 2 = b 0 b 1 b 2 b 3 P t = M H BH G
28 Bézier - Defined by - b 0 - start point - b 3 - end point - b 1, b 2 - control points that are approximated - Searching for P t such that: - P 0 = b 0 - P 0 = 3 b 1 b 0 - P 1 = 3 b 3 b 2 - P 1 = b 3 - Degree of P is 3 Basis: B 3 0 t = 1 t 3 B 3 1 t = 3 1 t 2 t B 3 2 t = 3 1 t t 2 B 3 3 t = t 3 Bernstein polynomial: B n i t = n t i i 1 t n i B = H BH = B 0 3 P t = i B B 2 3 b i B i n t B 3 3
29 Bézier properties Advantages: End point interpolation angents explicitly specified Smooth joints are simple P 3, P 4, P 5 collinear G 1 continuous P 5 -P 4 =P 4 -P 3 C 1 continuous Geometric meaning of control points Affine invariance Convex hull property For 0<t<1: B i (t) 0 Symmetry: B i (t) = B n-i (1-t) Disadvantages Smooth joints need to be maintained explicitly Automatic in B-Splines (and NURBS)
30 DeCasteljau Algorithm Bernstein polynomial defined recursively: P t = b i B i n t B i n t = n i t i 1 t n i = tb n 1 i 1 t + 1 t B n 1 i t i Recursive point computation: b 0 i t = b i b k+1 k i t = tb i+1 t + 1 t b i k t i i i b i k t B i n k t = b k i t tb n k 1 i 1 t + b k i t 1 t B n k 1 i t = k b i+1 t tb i n k 1 t + b i k t 1 t B i n k 1 t = i b i k+1 t B i n k 1 t P t = = b 0 n t
31 DeCasteljau Algorithm t= 0.5
32 Catmull-Rom-Splines Goal Smooth (C 1 )-joints between (cubic) spline segments Algorithm angents given by neighboring points P i-1 P i+1 Construct (cubic) Hermite segments Advantage Arbitrary number of control points Interpolation without overshooting Local control
33 Catmull-Rom-Splines - Each segment defined by - c 1 - start point - c 2 - end point - c 0, c 3 - neighbor segment points - Searching for P t such that: - P 0 = c 1 - P 0 = 1 2 c 2 c 0 - P 1 = 1 2 c 3 c 1 - P 1 = c 2 - Degree of P is 3
34 Catmull-Rom-Splines - Each segment defined by - c 1 - start point - c 2 - end point - c 0, c 3 - neighbor segment points - Searching for P t such that: - P 0 = c 1 - P 0 = 1 2 c 2 c 0 - P 1 = 1 2 c 3 c 1 - P 1 = c 2 - Degree of P is 3 p 1 t 1 t 2 p 2 = c 0 c 1 c 2 c 3 P t = M H CH G
35 Catmull-Rom-Splines - Each segment defined by - c 1 - start point - c 2 - end point - c 0, c 3 - neighbor segment points - Searching for P t such that: - P 0 = c 1 - P 0 = 1 2 c 2 c 0 - P 1 = 1 2 c 3 c 1 - P 1 = c 2 - Degree of P is 3 Basis: C 0 t = 1 t t C = H BH = C 1 t = 1 2 t 1 (3t2 2t 2) C 2 t = 1 2 t 3t2 4t 1 C 3 t = 1 2 t2 t 1
36 Catmull-Rom-Splines Catmull-Rom-Spline Piecewise polynomial curve Four control points per segment For n control points we obtain (n-3) polynomial segments Application Smooth interpolation of a given sequence of points Key frame animation, camera movement, etc. Control points should be equidistant in time
37 Choice of Parameterization Problem Often only the control points are given How to obtain a suitable parameterization t i? Example: Chord-Length Parameterization t 0 = 0 t i = j=1 Arbitrary up to a constant factor»warning Distances are not affine invariant! Shape of curves changes under transformations!! i dist P i P i 1
38 Choice of Parameterization Chord-Length versus uniform Parameterization Analog: hink P(t) as a moving object with mass that may overshoot Uniform Chord-Length
Introduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
More 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 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 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 informationKeyframing. CS 448D: Character Animation Prof. Vladlen Koltun Stanford University
Keyframing CS 448D: Character Animation Prof. Vladlen Koltun Stanford University Keyframing in traditional animation Master animator draws key frames Apprentice fills in the in-between frames Keyframing
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 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 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 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 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 informationAnimation Curves and Splines 1
Animation Curves and Splines 1 Animation Homework Set up a simple avatar E.g. cube/sphere (or square/circle if 2D) Specify some key frames (positions/orientations) Associate a time with each key frame
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 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 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 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 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 informationComputer Graphics Keyframing and Interpola8on
Computer Graphics Keyframing and Interpola8on This Lecture Keyframing and Interpola2on two topics you are already familiar with from your Blender modeling and anima2on of a robot arm Interpola2on linear
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 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 informationGeometric Interpolation by Planar Cubic Polynomials
1 / 20 Geometric Interpolation by Planar Cubic Polynomials Jernej Kozak, Marjeta Krajnc Faculty of Mathematics and Physics University of Ljubljana Institute of Mathematics, Physics and Mechanics Avignon,
More 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 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 informationNumerical Methods I: Interpolation (cont ed)
1/20 Numerical Methods I: Interpolation (cont ed) Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 30, 2017 Interpolation Things you should know 2/20 I Lagrange vs. Hermite interpolation
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Approximation Bézier curves B- 1 Some vocabulary (again ;) Control point : Geometric point that serves as support to the
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 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 informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
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 informationChapter 1 Numerical approximation of data : interpolation, least squares method
Chapter 1 Numerical approximation of data : interpolation, least squares method I. Motivation 1 Approximation of functions Evaluation of a function Which functions (f : R R) can be effectively evaluated
More 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 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 informationApplied Math 205. Full office hour schedule:
Applied Math 205 Full office hour schedule: Rui: Monday 3pm 4:30pm in the IACS lounge Martin: Monday 4:30pm 6pm in the IACS lounge Chris: Tuesday 1pm 3pm in Pierce Hall, Room 305 Nao: Tuesday 3pm 4:30pm
More informationG-code and PH curves in CNC Manufacturing
G-code and PH curves in CNC Manufacturing Zbyněk Šír Institute of Applied Geometry, JKU Linz The research was supported through grant P17387-N12 of the Austrian Science Fund (FWF). Talk overview Motivation
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 informationCubic Splines MATH 375. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Cubic Splines
Cubic Splines MATH 375 J. Robert Buchanan Department of Mathematics Fall 2006 Introduction Given data {(x 0, f(x 0 )), (x 1, f(x 1 )),...,(x n, f(x n ))} which we wish to interpolate using a polynomial...
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 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 informationInterpolation Theory
Numerical Analysis Massoud Malek Interpolation Theory The concept of interpolation is to select a function P (x) from a given class of functions in such a way that the graph of y P (x) passes through the
More informationMAT 300 Midterm Exam Summer 2017
MAT Midterm Exam Summer 7 Note: For True-False questions, a statement is only True if it must always be True under the given assumptions, otherwise it is False.. The control points of a Bezier curve γ(t)
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More informationPlanar interpolation with a pair of rational spirals T. N. T. Goodman 1 and D. S. Meek 2
Planar interpolation with a pair of rational spirals T N T Goodman and D S Meek Abstract Spirals are curves of one-signed monotone increasing or decreasing curvature Spiral segments are fair curves with
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 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 informationPythagorean-hodograph curves
1 / 24 Pythagorean-hodograph curves V. Vitrih Raziskovalni matematični seminar 20. 2. 2012 2 / 24 1 2 3 4 5 3 / 24 Let r : [a, b] R 2 be a planar polynomial parametric curve ( ) x(t) r(t) =, y(t) where
More 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 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 - Foundation of Free-form Surfaces
Crves - Fondation of Free-form Srfaces Why Not Simply Use a Point Matrix to Represent a Crve? Storage isse and limited resoltion Comptation and transformation Difficlties in calclating the intersections
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 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 informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 7 Interpolation Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted
More informationIsogeometric Analysis with Geometrically Continuous Functions on Two-Patch Geometries
Isogeometric Analysis with Geometrically Continuous Functions on Two-Patch Geometries Mario Kapl a Vito Vitrih b Bert Jüttler a Katharina Birner a a Institute of Applied Geometry Johannes Kepler University
More informationAFFINE COMBINATIONS, BARYCENTRIC COORDINATES, AND CONVEX COMBINATIONS
On-Line Geometric Modeling Notes AFFINE COMBINATIONS, BARYCENTRIC COORDINATES, AND CONVEX COMBINATIONS Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University
More informationVisualizing Bezier s curves: some applications of Dynamic System Geogebra
Visualizing Bezier s curves: some applications of Dynamic System Geogebra Francisco Regis Vieira Alves Instituto Federal de Educação, Ciência e Tecnologia do Estado do Ceará IFCE. Brazil fregis@ifce.edu.br
More informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
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 informationGENG2140, S2, 2012 Week 7: Curve fitting
GENG2140, S2, 2012 Week 7: Curve fitting Curve fitting is the process of constructing a curve, or mathematical function, f(x) that has the best fit to a series of data points Involves fitting lines and
More informationIntroduction. Introduction (2) Easy Problems for Vectors 7/13/2011. Chapter 4. Vector Tools for Graphics
Introduction Chapter 4. Vector Tools for Graphics In computer graphics, we work with objects defined in a three dimensional world (with 2D objects and worlds being just special cases). All objects to be
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationNumerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.
Unit IV Numerical Integration and Differentiation Numerical integration and differentiation quadrature classical formulas for equally spaced nodes improper integrals Gaussian quadrature and orthogonal
More informationExam 2. Average: 85.6 Median: 87.0 Maximum: Minimum: 55.0 Standard Deviation: Numerical Methods Fall 2011 Lecture 20
Exam 2 Average: 85.6 Median: 87.0 Maximum: 100.0 Minimum: 55.0 Standard Deviation: 10.42 Fall 2011 1 Today s class Multiple Variable Linear Regression Polynomial Interpolation Lagrange Interpolation Newton
More informationNumerical Methods I: Polynomial Interpolation
1/31 Numerical Methods I: Polynomial Interpolation Georg Stadler Courant Institute, NYU stadler@cims.nyu.edu November 16, 2017 lassical polynomial interpolation Given f i := f(t i ), i =0,...,n, we would
More information1 Piecewise Cubic Interpolation
Piecewise Cubic Interpolation Typically the problem with piecewise linear interpolation is the interpolant is not differentiable as the interpolation points (it has a kinks at every interpolation point)
More informationSubdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 Subdivision Matrices Iterated Function Systems for Parametric Interval Bezier Curves O. Ismail, Senior Member,
More information3.1 Interpolation and the Lagrange Polynomial
MATH 4073 Chapter 3 Interpolation and Polynomial Approximation Fall 2003 1 Consider a sample x x 0 x 1 x n y y 0 y 1 y n. Can we get a function out of discrete data above that gives a reasonable estimate
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 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 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 informationLösning: Tenta Numerical Analysis för D, L. FMN011,
Lösning: Tenta Numerical Analysis för D, L. FMN011, 090527 This exam starts at 8:00 and ends at 12:00. To get a passing grade for the course you need 35 points in this exam and an accumulated total (this
More informationLecture 5 3D polygonal modeling Part 1: Vector graphics Yong-Jin Liu.
Fundamentals of Computer Graphics Lecture 5 3D polygonal modeling Part 1: Vector graphics Yong-Jin Liu liuyongjin@tsinghua.edu.cn Material by S.M.Lea (UNC) Introduction In computer graphics, we work with
More informationQuaternion Cubic Spline
Quaternion Cubic Spline James McEnnan jmcennan@mailaps.org May 28, 23 1. INTRODUCTION A quaternion spline is an interpolation which matches quaternion values at specified times such that the quaternion
More information13 Path Planning Cubic Path P 2 P 1. θ 2
13 Path Planning Path planning includes three tasks: 1 Defining a geometric curve for the end-effector between two points. 2 Defining a rotational motion between two orientations. 3 Defining a time function
More informationPolynomials. p n (x) = a n x n + a n 1 x n 1 + a 1 x + a 0, where
Polynomials Polynomials Evaluation of polynomials involve only arithmetic operations, which can be done on today s digital computers. We consider polynomials with real coefficients and real variable. p
More informationNumerical Mathematics & Computing, 7 Ed. 4.1 Interpolation
Numerical Mathematics & Computing, 7 Ed. 4.1 Interpolation Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole www.engage.com www.ma.utexas.edu/cna/nmc6 November 7, 2011 2011 1 /
More informationComputational Physics
Interpolation, Extrapolation & Polynomial Approximation Lectures based on course notes by Pablo Laguna and Kostas Kokkotas revamped by Deirdre Shoemaker Spring 2014 Introduction In many cases, a function
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 informationHome Page. Title Page. Contents. Bezier Curves. Milind Sohoni sohoni. Page 1 of 27. Go Back. Full Screen. Close.
Bezier Curves Page 1 of 27 Milind Sohoni http://www.cse.iitb.ac.in/ sohoni Recall Lets recall a few things: 1. f : [0, 1] R is a function. 2. f 0,..., f i,..., f n are observations of f with f i = f( i
More informationEngineering 7: Introduction to computer programming for scientists and engineers
Engineering 7: Introduction to computer programming for scientists and engineers Interpolation Recap Polynomial interpolation Spline interpolation Regression and Interpolation: learning functions from
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 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 information2 The De Casteljau algorithm revisited
A new geometric algorithm to generate spline curves Rui C. Rodrigues Departamento de Física e Matemática Instituto Superior de Engenharia 3030-199 Coimbra, Portugal ruicr@isec.pt F. Silva Leite Departamento
More informationPolynomial approximation and Splines
Polnomial approimation and Splines 1. Weierstrass approimation theorem The basic question we ll look at toda is how to approimate a complicated function f() with a simpler function P () f() P () for eample,
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 informationEmpirical Models Interpolation Polynomial Models
Mathematical Modeling Lia Vas Empirical Models Interpolation Polynomial Models Lagrange Polynomial. Recall that two points (x 1, y 1 ) and (x 2, y 2 ) determine a unique line y = ax + b passing them (obtained
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 informationA Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve
A Variational Model for Data Fitting on Manifolds by Minimizing the Acceleration of a Bézier Curve Ronny Bergmann a Technische Universität Chemnitz Kolloquium, Department Mathematik, FAU Erlangen-Nürnberg,
More informationChordal cubic spline interpolation is fourth order accurate
Chordal cubic spline interpolation is fourth order accurate Michael S. Floater Abstract: It is well known that complete cubic spline interpolation of functions with four continuous derivatives is fourth
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationData Analysis-I. Interpolation. Soon-Hyung Yook. December 4, Soon-Hyung Yook Data Analysis-I December 4, / 1
Data Analysis-I Interpolation Soon-Hyung Yook December 4, 2015 Soon-Hyung Yook Data Analysis-I December 4, 2015 1 / 1 Table of Contents Soon-Hyung Yook Data Analysis-I December 4, 2015 2 / 1 Introduction
More informationChapter 2 Interpolation
Chapter 2 Interpolation Experiments usually produce a discrete set of data points (x i, f i ) which represent the value of a function f (x) for a finite set of arguments {x 0...x n }. If additional data
More informationMA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm
MA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm David L. Finn December 16th, 2004 Today, we introduce barycentric coordinates as an alternate to using
More informationSome notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation
Some notes on Chapter 8: Polynomial and Piecewise-polynomial Interpolation See your notes. 1. Lagrange Interpolation (8.2) 1 2. Newton Interpolation (8.3) different form of the same polynomial as Lagrange
More informationFunction Approximation
1 Function Approximation This is page i Printer: Opaque this 1.1 Introduction In this chapter we discuss approximating functional forms. Both in econometric and in numerical problems, the need for an approximating
More informationGeometric Hermite curves with minimum strain energy
R Available online at www.sciencedirect.com Computer Aided Geometric Design 21 (2004) 281 301 www.elsevier.com/locate/cagd Geometric Hermite curves with minimum strain energy Jun-Hai Yong, Fuhua (Frank)
More information19.4 Spline Interpolation
c9-b.qxd 9/6/5 6:4 PM Page 8 8 CHAP. 9 Numerics in General 9.4 Spline Interpolation Given data (function values, points in the xy-plane) (x, ƒ ), (x, ƒ ),, (x n, ƒ n ) can be interpolated by a polynomial
More informationCurve Fitting and Interpolation
Chapter 5 Curve Fitting and Interpolation 5.1 Basic Concepts Consider a set of (x, y) data pairs (points) collected during an experiment, Curve fitting: is a procedure to develop or evaluate mathematical
More informationCS545 Contents XIII. Trajectory Planning. Reading Assignment for Next Class
CS545 Contents XIII Trajectory Planning Control Policies Desired Trajectories Optimization Methods Dynamical Systems Reading Assignment for Next Class See http://www-clmc.usc.edu/~cs545 Learning Policies
More informationNumerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi
Numerical Methods and Computation Prof. S.R.K. Iyengar Department of Mathematics Indian Institute of Technology Delhi Lecture No - 27 Interpolation and Approximation (Continued.) In our last lecture we
More informationA 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 information