CGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space
|
|
- Elwin Marsh
- 5 years ago
- Views:
Transcription
1 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 in an nd space 2) A continuous map of a 1D space to an nd space Curves What is a curve? Physical definition i i curve is a trajectory of a moving point This definition is usually good enough in CG Curves Any point has two neighbors (no branching) Endpoints have one Some curves do not have endpoints Infinite curves Closed curves Periodic curves (except for space filling curves they are 2D )
2 Curve representation Explicit: y=f(x) cannot represent closed curves Implicit: f(x,y)=0 many good properties usually must be calculated numerically f(x,y) is a scalar function (one number) Curve representation Parametric: Q ( t ) = [ x ( t ), y ( t ), z ( t )] curve is a function of one parameter a trajectory of a moving point the meaning of the parameter t is the time It returns two or more values (vector) Curve representation trajectory (curve) is thus represented as a set of points in space Parametric Representation Example Sinusoidal curve Q(t)=[t, sin(t)] x=x(t) y=y(t) z=z(t) Circle Q(t)=[r sin(t), r cos(t)] Parabola Q(t)=[t, t2]
3 Parametric Representation The parameter t usually goes from 0 to 1 ( 0 t 1 ) Q(0)=[x(0),y(0),z(0)] the starting point of the curve Q(1)=[x(1),y(1),z(1)] (1)] the end point of the curve Points and Vectors Let s have two points A and B The vector P is the P=B A Example: A=[1,2,0], B=[2,1,0] P= B A = [2,1,0] [1,2,0] = (1, 1,0) the same vector can be obtained from an infinite number of different pairs! e.g., from A=[0,0,0], B=[1, 1,0] Points and Vectors A vector represents a set of oriented lines In other words a vector can be translated! A vector added to a point yields to a new point Example: A=[1,2,0], P=(1, 1,0) A+P=[1,2,0] + (1, 1,0) = [2,1,0] Parametric Equation of a Line Defined by two points A and B its equation is Q(t) = [x(t), y(t), z(t)] = A + t(b A); < t < there are special cases: Q(0) = A Q(1) = B Note also: Point + t Vector >point
4 Parametric Equation of a Line Example: A=[1,2,3], B=[0,1,6] Q(t)=[x(t), y(t), z(t)] = = [1,2,3] + t ([0,1,6] [1,2,3])= = [1 t, 2 t, 3+3t] try t=0 Q(0) = [1,2,3] t=1 Q(1) = [1 1,2 1,3+3] = [0,1,6] Parametric Equation of a Line Can be also thought of as a blending function x(t) = (1 t) X1 + t X2 y(t) = (1 t) Y1 + t Y2 z(t) = (1 t) Z1 + t Z2 this linear blending is frequently used in CG: P(t) = A+t(B A) A) P(t) = (1 t) A + t B Note:(1 t)+t=1 Parametric Curve Derivative The derivative dq( t) dx( t) dy( t) dz( t) Q'( t) = =,, dt dt dt dt Example: derivatives of the functions from the previous examples: sin. curve Q(t)=[t, sin(t)] Q (t) = (1, cos(t)) circle Q(t)=[r sin(t), r cos(t)] Q (t) (t)=(r(r cos(t), r r sin(t)) parabola Q(t)=[t2,t] Q (t)=(2t,1) Parametric Curve Derivative Note: Curve is a set of points Derivative of a curve is a vector. Why? Take the limit process A dq( t) Q'( t) = = lim dt Δt > 0 Δt B A B Δt A Δt B A B Δt
5 Parametric Curve Derivative The derivative is the tangent t vector to the function in the given point Tangent is a line passing through the given point in the direction of the tangent vector P(t) Tangent & Tangent Vector Example Example: Having curve Q(t)=[ 4t 3 +6t 2, 6t 3 9t 2 +3t] Evaluate tangent in the point Q(0.5). Solution: 1. Get the point Q(0.5) 2. Evaluate derivative Q (t) 3. Evaluate tangent vector Q (0.5) 4. Tangent is: P(s)=Q(0.5) + s Q (0.5) Tangent & Tangent Vector Example ad 1. Q(0.5)= [ 4*0.53+6*0.52, 6*0.53 9*0.52+3*0.5]=[1,0] ad d2. Q () Q (t) = (12 ( 12t2+12t, 2 18t2 18t+3) ad 3. Q (0.5) = (3, 3/2) ad 4. P(s) = [1,0] + s*(3, 3/2) by the way: P(0)=[1,0]=Q(0.5) 1 2 P(s) Q(t) Parametric curves continuity Motivation: Expression of the entire shape from only one curve is usually impossibleibl Curves are connected together Every part of the curve is called a segment The point where curves meet is a knot (joint) The parametric continuity is denoted by C
6 Parametric curves continuity knot segment Free form curves continuity C 0 If two segments meet in a point, they are continuously connected or simply connected It is denoted by C 0 Two segments Q 1 (t) and Q 2 (t) are continuously connected iff Q 1 (1) = Q 2 (0) One segment starts where the other ends Free form curves continuity C 1 So called C 1 parametric continuity requires two segments to be C 0 and their derivatives to be equal in the Denoted by C 1 They share tangent in the knot (not only the tangent vectors) If we move from the one curve to the other, speed and the direction is unchanged (continuous) Free form curves continuity C 1 Two segments Q 1 (t) and Q 2 (t) are parametrically continuously connected iff 1) Q 1 (1)=Q 2 (0) Equality in the knot 2) Q 1 (1)=Q 2 (0) Derivatives i in the knot are equal Does C 1 imply C 0?
7 Continuity C 0 vs. C 1 Continuity C 0 : the knot is equal, but the tangent vectors are different Continuity C 0 vs. C 1 Continuity C 1 : the knot is equal, the tangent as well, and the tangents vectors are nonzero Q 1 (1)=Q 2 (0) Q 1 (1) Q 1 (t) Q 1 (t) Q 2 (0) Q 2 (t) Q 1 (1)=Q 2 (0) Q 1 (1)=Q 2 (0) Q 2 (0) Continuity C 2,C 3,C n Continuity C 2,C 3,C n A curve is C n continuous iff it has continuous nonzero derivatives of order 0, 1,, n in every point Two curves meet C n continuously iff they have continuous nonzero derivatives of order 0, 1,, n in every ypoint Note: polynomial functions are C
8 Continuity C 2,C 3,,C n Curves continuity (contd.) Example: Q 1 (t)=[sin(π t/2), cos(π t/2)] (0 t 1) Q 2 (t)=[1, ππ t/2] (0 t 1) Are they parametrically continuous? Curves continuity (contd.) Solution: ad 1) Q 1 (1) = [sin(π /2), cos(π /2)] = [1, 0] Q 2 2( (0) = [1, 0] this is OK 2) Q 1 (t)=(π /2 cos(π t/2), π /2sin(π t/2)) Q 2 (t)=(0, π /2) Q 1 (1)=(π /2 cos(π /2), π /2sin(π /2)) = (0, π /2) Curves continuity (contd.) These two segments make curve that is parametrically continuous in the knot that is OK as well
9 Curves continuity (contd.) Example: Let s have curves: Q(t)=[2t,2t], 2t] (0 t 1) R(t)=[t+2,t+2], (0 t 1) Is the curve formed by them (if any) C 1? Curves continuity (contd.) Solution: 1) Q(1)=[2,2] R(0)=[2,2] 2] 2) Q (t)=(2,2) R (t)=(1,1) ( ) The curves definitively meet smoothly, but they are NOT parametrically continuous. Tangent vector sizes are different! Q (t)=(2,2)r (t)=(1,1) Geometric Continuity G 1 Geometric continuity means visual smoothness. The moving point changes the speed but not the direction. Two curves are geometrically continuous if their derivatives in knot are positively linearly dependent Geometric Continuity G 1 Two segments Q 1 (t) and Q 2 (t) are geometrically continuously connected iff 1) Q1(1)=Q2(0) they meet in the knot 2) Q 1(1)= k Q 2(0), k>0 their derivatives in the knot are linearly l dependentd Does C 1 implies G 1?
10 Geometric Continuity G 1 Continuity summary Continuity (zero order continuity): C 0 two curves meet in the knot Parametric continuity i (first order continuity): i C 1 the curves meet in knot and their derivatives are equal (the joint is smooth) Geometric continuity: G 1 the curves meet in knot and their derivatives are linearly positively dependent (the joint point is visually smooth) Modeling curves The most important curves in CG are polynomial curves i.e., curves that can be represented as the canonical form of a polygon Q(t) = a 0 + a 1 t + a 2 t a n t n = a i t i Q(t) = c 0 b 0 (t)+c 1 b 1 (t)+ +c n b n (t)= c i b i (t) the b(t) are the basis function or the blending functions Basis Function Example: Line segment can be expressed as: Q(t)=b 0 (t) p 0 +b 1 (t)p 1 Where: b 0 (t)=1 t b 1 (t)=t
11 Modeling curves Why polynomials? they can be derived easily they are C they provide many shapes they can be easily evaluated using Horner s scheme i.e., p(t) = a 0 + t (a 1 + t (a 2 + t (a 3 + +a n ) ) that is using only addition and multiplication! Modeling curves The most important are so called cubics (for 99% applications) Cubics are the lowest degree curves that can describe a S shaped curved (it has the inflection point) that is polynomials of order three that is: P[x(t), y(t), z(t)] = = [x 0 +x 1 t+x 2 t 2 +x 3 t 3,y 0 +y 1 t+y 2 t 2 +y 3 t 3,z 0 +z 1 t+z 2 t 2 +z 3 t 3 ] Modeling curves P[x(t), y(t), z(t)] = = [x 0 +x 1 t+x 2 t 2 +x 3 t 3,y 0 +y 1 t+y 2 t 2 +y 3 t 3,z 0 +z 1 t+z 2 t 2 +z 3 t 3 ] the coefficients define the shape of a segment it is almost impossible to enter them by hand Curves are modeled using so called control points or control vertices Modeling curves Control points can form the curve in two ways 1) approximation (at least one point is not passed through) 2) interpolation (passing through)
12 Modeling curves Bézier cubic Bézier curves (namely Bézier cubics) are the most popular curves used in CG Used for fonts Pierre Etienne Bézier (Sep Oct ) One segment of Bézier cubic is given by four control points These points form so called control polygon of the segment Bézier cubic Bézier cubic The control points are denoted by P o, P 1, P 2, P 3 Properties: Convex hull property As any of these points move the entire segment changes its shape
13 Bézier cubic Bézier cubic Bézier cubic is given by the control points and Q(t)=[x(t),y(t),z(t)]=P 0 B 0 (t)+p 1 B 1 (t)+p 2 B 2 (t)+p 3 B 3 (t)= 3 = Pi B i ( t) parameter t is 0 t 1 i= 0 B 0 (t)= (1 t) 3 B 1 (t) = 3t (1 t) 2 B 2 (t) = 3t 2 (1 t) B 3 (t) = t 3 Bernstein polynomials or Bézier basis functions P i are points, so we have three equations in 3D Bézier cubic Properties of the Bernstein polynomials B 0 + B 1 + B 2 + B 3 = 1 (they sum to unity) (...homework) 0 B i (t) 1; for 0 t 1 (nonzero property) we cannot represent conic sections using Bézier cubics (so we cannot draw a circle!) Bézier cubic Properties of Bézier curves Curve interpolates the first and the last control point i.e., Q(0) = P 0 and Q(1)=P 3 Convex hull property any point of the curve lies inside the convex hull defined by the control points
14 Bézier cubic Properties of Bézier curves (contd.) Invariance under affine transformations (scale, rotate, translate, shear) 3 i=0 A(Q(t)) = A(P i )B i (t) () in other words: rotating the curve can be done by rotating its control points This is NOT true for projections! Bézier cubic rasterization Bezier(PointT P0,PointT P1, PointT P2, PointT P3, int n){ //P0,,P3 are the control points //n is the # of lines used for approximation double t, deltat; PointT a, b; int i; deltat = 1.0/n;//curve will be approximated by n lines a = Q(0, PO, P1, P2, P3); //the first point of the curve t = 0; for (i=0;i<n;i++){ //for all lines do b = Q(t+deltat, t PO, P1, P2, P3);//endpoint of line Line(a,b); //render line a=b; //end becomes the start now t += deltat; //increase the t variable } } Bézier cubic rasterization PointT Q(double t, PointT P0,PointT P1,PointT P2, PointT P3){ double B0, B1, B2, B3; static PointT hlp; B0=(1-t)*(1-t)*(1-t); B1=3*t*(1-t)*(1-t); t)*(1 t) B2=3*t*t*(1-t); B3=t*t*t; hlp.x = P0.x*B0 0 + P1.x*B1 1 + P2.x*B2 2 + P3.x*B3; 3 hlp.y = P0.y*B0 + P1.y*B1 + P2.y*B2 + P3.y*B3; return hlp; } Connecting Bézier cubic Provides a piecewise Bézier curve the parameter of the entire curve is 0 t n, where n is the number of the segments each segment is defined for 0 t 1 we have to perform reparametrization first t t t ' = t t this scales the interval to [0,1] for each segment
15 Bézier cubic derivative Bézier cubic derivative The curve is C Derivative in knots: Q(0) and Q(1) it can be easily shown that: Q (0)=3(P 1 P 0 ) Q (1)=3(P 3 P 2 ) Bézier cubic derivative Let s have two Bézier cubic segments consisting Let s connect them 1) continuously 2) parametrically continuously (smooth) 3) geometrically continuously (visually smooth) Bézier cubic connection C 0 Bézier curves interpolate the first and last control point i.e., Q(0) = P 0 and Q(1)=P 3 last control point of the first segment must be the first control point of the next segment
16 Bézier cubic connection C 0 P2 P1 Q1 Bézier cubic connection C 1 two segments meet C 1 iff the last two control points of the first segment and the first two points of the second curve form line with the common point in the middle P0 P =Q 3 0 Q3 Q Q2 The tangent vectors are equal, i.e., 3(P 3 P 2 )=3(Q 1 Q 0 ) Bézier cubic connection C 1 Bézier cubic connection G 1 two segments meet G 1 iff last two control points of the first segment and first two points of the second curve form line with common point somewhere between them The tangent vectors are parallel and equally oriented, i.e., (P 3 P 2 )=k(q 1 Q 0 ) k>0
17 Bézier cubic connection G 1 Connecting Bézier Curves Moving one point affects max two segments We can add/erase just a piece of the curve It is standard in SW de Casteljau algorithm The naïve algorithm for rasterization Bézier curves is not efficient It produces equal number of fline segments for entire segment de Casteljau algorithm de Casteljau algorithm is an adaptive solution providing higher subdivision on parts with high curvature and vice versa
18 de Casteljau algorithm Recursive formula for Bernstein polynomials Provides one point on the curve de Casteljau algorithm Pi,j (t) = (1 t) Pj 1,i (t) + t Pj,i 1 (t) where i,j=1,2,,n The initial values are control points P0,i=Pi and j coefficient corresponds j the to the level of recursion The last point is thus Pn,n de Casteljau algorithm Geometric interpretation de Casteljau algorithm The most important is: P0, P1,1, P2,2, Q(t) and Q(t), P3,2, P3,1, P3 are control points of a sub segmentssegments
19 de Casteljau algorithm de Casteljau algorithm The criterion to stop the subdivision may be: 1) Control points are in one pixel 2) Control polygon is smaller than a pixel (antialiasing) 3) Control polygon is lineal 4) Area of the control polygon is small etc. Hermite Cubic Interpolation A segment of Hermite cubic interpolation curve is given by two control points P 0, P 1, and the two tangent vectors P 0, P 1, in them Charles Hermite (Dec Jan )) P 0 P 0 P 1 P 1 Hermite Cubic Interpolation given by the equation: Q(t)=P 0 F 0 (t) + P 1 F 1 (t) + P 0 F 2 (t) + P 1 F 3 (t) where: F 0 (t) = 2t 3 3t F = 2t 3 +3t 2 1 (t) F 2 (t) = t 3 2t 2 + t F 3 (t) = t 3 t 2 setting Q(0) we get P 0 setting Q(1) we get P 1 It is interpolation
20 Hermite Cubic Interpolation Hermite Cubic Interpolation P'0 P0 P1 P'0 P0 P 1 P'1 P1 Advantage having two segments given by P 0, P 1, P 0, P 1,and Q 0, Q 1, Q 0, Q 1, C 0 simply equality of the points P 1 =Q 0 P'1 P0 P'1 P1 C 1 simply equality of the vectors P 1 =Q 0 G 1 first vector is k times equal to the other P 1 =k*q 0 ; k>0 P'0 Hermite Cubic Interpolation Disadvantage: they are not easy to edit By the way Hermite s cubics are a different representation of Bézier cubics and vice versa Conclusion This was a very gentle intro to curves What is missing: Splines the most important ones NUBS even more important Subdivision curves
21 Summary Parametric equation of curve Derivative, tangent, tangent vector Continuity Modeling curves (interpolation, approximation) Bézier cubic Hermite cubic Readings Interactive Computer Graphics 5th edition, Ed. Angel pp Real Time Rendering 2nd edition, Moller, T.A., Haines, E., Geometric Modeling, 2nd edition, i M.E.Mortenson
Approximation of Circular Arcs by Parametric Polynomials
Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationMath 234. What you should know on day one. August 28, You should be able to use general principles like. x = cos t, y = sin t, 0 t π.
Math 234 What you should know on day one August 28, 2001 1 You should be able to use general principles like Length = ds, Area = da, Volume = dv For example the length of the semi circle x = cos t, y =
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationLecture 11: Arclength and Line Integrals
Lecture 11: Arclength and Line Integrals Rafikul Alam Department of Mathematics IIT Guwahati Parametric curves Definition: A continuous mapping γ : [a, b] R n is called a parametric curve or a parametrized
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 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 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 informationQ( t) = T C T =! " t 3,t 2,t,1# Q( t) T = C T T T. Announcements. Bezier Curves and Splines. Review: Third Order Curves. Review: Cubic Examples
Bezier Curves an Splines December 1, 2015 Announcements PA4 ue one week from toay Submit your most fun test cases, too! Infinitely thin planes with parallel sies μ oesn t matter Term Paper ue one week
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 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 informationExercises for Multivariable Differential Calculus XM521
This document lists all the exercises for XM521. The Type I (True/False) exercises will be given, and should be answered, online immediately following each lecture. The Type III exercises are to be done
More informationLecture 9. Systems of Two First Order Linear ODEs
Math 245 - Mathematics of Physics and Engineering I Lecture 9. Systems of Two First Order Linear ODEs January 30, 2012 Konstantin Zuev (USC) Math 245, Lecture 9 January 30, 2012 1 / 15 Agenda General Form
More information16.2 Line Integrals. Lukas Geyer. M273, Fall Montana State University. Lukas Geyer (MSU) 16.2 Line Integrals M273, Fall / 21
16.2 Line Integrals Lukas Geyer Montana State University M273, Fall 211 Lukas Geyer (MSU) 16.2 Line Integrals M273, Fall 211 1 / 21 Scalar Line Integrals Definition f (x) ds = lim { s i } N f (P i ) s
More informationContinuous Curvature Path Generation Based on Bézier Curves for Autonomous Vehicles
Continuous Curvature 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
More informationAlgebraic Curves. (Com S 477/577 Notes) Yan-Bin Jia. Oct 17, 2017
Algebraic Curves (Com S 477/577 Notes) Yan-Bin Jia Oct 17, 2017 An algebraic curve is a curve which is described by a polynomial equation: f(x,y) = a ij x i y j = 0 in x and y. The degree of the curve
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 informationMTH4100 Calculus I. Week 6 (Thomas Calculus Sections 3.5 to 4.2) Rainer Klages. School of Mathematical Sciences Queen Mary, University of London
MTH4100 Calculus I Week 6 (Thomas Calculus Sections 3.5 to 4.2) Rainer Klages School of Mathematical Sciences Queen Mary, University of London Autumn 2008 R. Klages (QMUL) MTH4100 Calculus 1 Week 6 1 /
More informationMATH 280 Multivariate Calculus Fall Integrating a vector field over a curve
MATH 280 Multivariate alculus Fall 2012 Definition Integrating a vector field over a curve We are given a vector field F and an oriented curve in the domain of F as shown in the figure on the left below.
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 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 informationSpeed and Velocity: Recall from Calc 1: If f (t) gives the position of an object at time t, then. velocity at time t = f (t) speed at time t = f (t)
Speed and Velocity: Recall from Calc 1: If f (t) gives the position of an object at time t, then velocity at time t = f (t) speed at time t = f (t) Math 36-Multi (Sklensky) In-Class Work January 8, 013
More informationTopic 2-2: Derivatives of Vector Functions. Textbook: Section 13.2, 13.4
Topic 2-2: Derivatives of Vector Functions Textbook: Section 13.2, 13.4 Warm-Up: Parametrization of Circles Each of the following vector functions describe the position of an object traveling around the
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 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 informationVectors Coordinate frames 2D implicit curves 2D parametric curves. Graphics 2008/2009, period 1. Lecture 2: vectors, curves, and surfaces
Graphics 2008/2009, period 1 Lecture 2 Vectors, curves, and surfaces Computer graphics example: Pixar (source: http://www.pixar.com) Computer graphics example: Pixar (source: http://www.pixar.com) Computer
More informationTopic 5.1: Line Element and Scalar Line Integrals
Math 275 Notes Topic 5.1: Line Element and Scalar Line Integrals Textbook Section: 16.2 More Details on Line Elements (vector dr, and scalar ds): http://www.math.oregonstate.edu/bridgebook/book/math/drvec
More informationV11. Line Integrals in Space
V11. Line Integrals in Space 1. urves in space. In order to generalize to three-space our earlier work with line integrals in the plane, we begin by recalling the relevant facts about parametrized space
More informationParametric Curves. (Com S 477/577 Notes) Yan-Bin Jia. Oct 3, 2017
Parametric Curves (Com S 477/577 Notes) Yan-Bin Jia Oct 3, 2017 1 Introduction A curve in R 2 (or R 3 ) is a differentiable function α : [a,b] R 2 (or R 3 ). The initial point is α[a] and the final point
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 information1.1 Single Variable Calculus versus Multivariable Calculus Rectangular Coordinate Systems... 4
MATH2202 Notebook 1 Fall 2015/2016 prepared by Professor Jenny Baglivo Contents 1 MATH2202 Notebook 1 3 1.1 Single Variable Calculus versus Multivariable Calculus................... 3 1.2 Rectangular Coordinate
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 informationCalculus I Review Solutions
Calculus I Review Solutions. Compare and contrast the three Value Theorems of the course. When you would typically use each. The three value theorems are the Intermediate, Mean and Extreme value theorems.
More informationMath 113 Final Exam Practice
Math Final Exam Practice The Final Exam is comprehensive. You should refer to prior reviews when studying material in chapters 6, 7, 8, and.-9. This review will cover.0- and chapter 0. This sheet has three
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 informationEntrance Exam, Differential Equations April, (Solve exactly 6 out of the 8 problems) y + 2y + y cos(x 2 y) = 0, y(0) = 2, y (0) = 4.
Entrance Exam, Differential Equations April, 7 (Solve exactly 6 out of the 8 problems). Consider the following initial value problem: { y + y + y cos(x y) =, y() = y. Find all the values y such that the
More informationDepartment of Mathematics IIT Guwahati
Stability of Linear Systems in R 2 Department of Mathematics IIT Guwahati A system of first order differential equations is called autonomous if the system can be written in the form dx 1 dt = g 1(x 1,
More information(1) Recap of Differential Calculus and Integral Calculus (2) Preview of Calculus in three dimensional space (3) Tools for Calculus 3
Math 127 Introduction and Review (1) Recap of Differential Calculus and Integral Calculus (2) Preview of Calculus in three dimensional space (3) Tools for Calculus 3 MATH 127 Introduction to Calculus III
More informationPath Planning based on Bézier Curve for Autonomous Ground Vehicles
Path Planning based on Bézier Curve for Autonomous Ground Vehicles Ji-wung Choi Computer Engineering Department University of California Santa Cruz Santa Cruz, CA95064, US jwchoi@soe.ucsc.edu Renwick Curry
More informationIntro Vectors 2D implicit curves 2D parametric curves. Graphics 2011/2012, 4th quarter. Lecture 2: vectors, curves, and surfaces
Lecture 2, curves, and surfaces Organizational remarks Tutorials: Tutorial 1 will be online later today TA sessions for questions start next week Practicals: Exams: Make sure to find a team partner very
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 informationAppendix E : Note on regular curves in Euclidean spaces
Appendix E : Note on regular curves in Euclidean spaces In Section III.5 of the course notes we posed the following question: Suppose that U is a connected open subset of R n and x, y U. Is there a continuous
More informationa k 0, then k + 1 = 2 lim 1 + 1
Math 7 - Midterm - Form A - Page From the desk of C. Davis Buenger. https://people.math.osu.edu/buenger.8/ Problem a) [3 pts] If lim a k = then a k converges. False: The divergence test states that if
More informationGEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES
International Journal of Pure and Applied Mathematics Volume 65 No. 3 2010, 339-360 GEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES Arne Lakså 1, Børre Bang 2, Lubomir T. Dechevsky
More informationChapter 4: Interpolation and Approximation. October 28, 2005
Chapter 4: Interpolation and Approximation October 28, 2005 Outline 1 2.4 Linear Interpolation 2 4.1 Lagrange Interpolation 3 4.2 Newton Interpolation and Divided Differences 4 4.3 Interpolation Error
More informationLecture for Week 6 (Secs ) Derivative Miscellany I
Lecture for Week 6 (Secs. 3.6 9) Derivative Miscellany I 1 Implicit differentiation We want to answer questions like this: 1. What is the derivative of tan 1 x? 2. What is dy dx if x 3 + y 3 + xy 2 + x
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 informationCurve Fitting: Fertilizer, Fonts, and Ferraris
Curve Fitting: Fertilizer, Fonts, and Ferraris Is that polynomial a model or just a pretty curve? 22 nd CMC3-South Annual Conference March 3, 2007 Anaheim, CA Katherine Yoshiwara Bruce Yoshiwara Los Angeles
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 informationSolutions of Spring 2008 Final Exam
Solutions of Spring 008 Final Exam 1. (a) The isocline for slope 0 is the pair of straight lines y = ±x. The direction field along these lines is flat. The isocline for slope is the hyperbola on the left
More information5.3. Exercises on the curve analysis of polynomial functions
.. Exercises on the curve analysis of polynomial functions Exercise : Curve analysis Examine the following functions on symmetry, x- and y-intercepts, extrema and inflexion points. Draw their graphs including
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 informationENGI 4430 Line Integrals; Green s Theorem Page 8.01
ENGI 4430 Line Integrals; Green s Theorem Page 8.01 8. Line Integrals Two applications of line integrals are treated here: the evaluation of work done on a particle as it travels along a curve in the presence
More information0, such that. all. for all. 0, there exists. Name: Continuity. Limits and. calculus. the definitionn. satisfying. limit. However, is the limit of its
L Marizzaa A Bailey Multivariable andd Vector Calculus Name: Limits and Continuity Limits and Continuity We have previously defined limit in for single variable functions, but how do we generalize this
More informationSection 14.1 Vector Functions and Space Curves
Section 14.1 Vector Functions and Space Curves Functions whose range does not consists of numbers A bulk of elementary mathematics involves the study of functions - rules that assign to a given input a
More information2018 FREE RESPONSE QUESTION TENTATIVE SOLUTIONS
8 FREE RESPONSE QUESTION TENTATIVE SOLUTIONS L. MARIZZA A BAILEY Problem. People enter a line for an escalator at a rate modeled by the function, r given by { 44( t r(t) = ) ( t )7 ) t t > where r(t) is
More informationCG Basics 1 of 10. Mathematical Foundations: Vectors, Matrices, & Parametric Equations
CG Basics 1 of 10 ematical Foundations: Vectors, Matrices, & Parametric Equations William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://bit.ly/hgvxlh Course web
More informationMATH 2433 Homework 1
MATH 433 Homework 1 1. The sequence (a i ) is defined recursively by a 1 = 4 a i+1 = 3a i find a closed formula for a i in terms of i.. In class we showed that the Fibonacci sequence (a i ) defined by
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 informationNonlinear Means in Geometric Modeling
Nonlinear Means in Geometric Modeling Michael S. Floater SINTEF P. O. Box 124 Blindern, 0314 Oslo, Norway E-mail: Michael.Floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research
More informationParametric Curves. Calculus 2 Lia Vas
Calculus Lia Vas Parametric Curves In the past, we mostly worked with curves in the form y = f(x). However, this format does not encompass all the curves one encounters in applications. For example, consider
More informationMATH Max-min Theory Fall 2016
MATH 20550 Max-min Theory Fall 2016 1. Definitions and main theorems Max-min theory starts with a function f of a vector variable x and a subset D of the domain of f. So far when we have worked with functions
More informationMath 106 Answers to Exam 3a Fall 2015
Math 6 Answers to Exam 3a Fall 5.. Consider the curve given parametrically by x(t) = cos(t), y(t) = (t 3 ) 3, for t from π to π. (a) (6 points) Find all the points (x, y) where the graph has either a vertical
More informationIntro Vectors 2D implicit curves 2D parametric curves. Graphics 2012/2013, 4th quarter. Lecture 2: vectors, curves, and surfaces
Lecture 2, curves, and surfaces Organizational remarks Tutorials: TA sessions for tutorial 1 start today Tutorial 2 will go online after lecture 3 Practicals: Make sure to find a team partner very soon
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 informationMATH 2730: Multivariable Calculus. Fall 2018 C. Caruvana
MATH 273: Multivariable Calculus Fall 218 C. Caruvana Contents 1 Vectors 1 1.1 Vectors in the Plane.................................... 1 1.1.1 Vector Addition.................................. 3 1.1.2
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 informationDerivatives and Continuity
Derivatives and Continuity As with limits, derivatives do not exist unless the right and left-hand derivatives both exist and are equal. There are three main instances when this happens: One, if the curve
More informationName: SOLUTIONS Date: 11/9/2017. M20550 Calculus III Tutorial Worksheet 8
Name: SOLUTIONS Date: /9/7 M55 alculus III Tutorial Worksheet 8. ompute R da where R is the region bounded by x + xy + y 8 using the change of variables given by x u + v and y v. Solution: We know R is
More informationSystems of Linear Differential Equations Chapter 7
Systems of Linear Differential Equations Chapter 7 Doreen De Leon Department of Mathematics, California State University, Fresno June 22, 25 Motivating Examples: Applications of Systems of First Order
More informationChapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics
Chapter 3a Topics in differentiation Lectures in Mathematical Economics L Cagandahan Abueg De La Salle University School of Economics Problems in differentiation Problems in differentiation Problem 1.
More informationExam 3. MA 114 Exam 3 Fall Multiple Choice Questions. 1. Find the average value of the function f (x) = 2 sin x sin 2x on 0 x π. C. 0 D. 4 E.
Exam 3 Multiple Choice Questions 1. Find the average value of the function f (x) = sin x sin x on x π. A. π 5 π C. E. 5. Find the volume of the solid S whose base is the disk bounded by the circle x +
More informationOHSx XM521 Multivariable Differential Calculus: Homework Solutions 14.1
OHSx XM5 Multivariable Differential Calculus: Homework Solutions 4. (8) Describe the graph of the equation. r = i + tj + (t )k. Solution: Let y(t) = t, so that z(t) = t = y. In the yz-plane, this is just
More information