INTERPOLATION & APPROXIMATION. Curve algorithm General curve shape may be generated using method of –Interpolation (also known as curve fitting) Curve.

Slides:



Advertisements
Similar presentations
© University of Wisconsin, CS559 Spring 2004
Advertisements

Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Interpolation A method of constructing a function that crosses through a discrete set of known data points. .
CS 445/645 Fall 2001 Hermite and Bézier Splines. Specifying Curves Control Points –A set of points that influence the curve’s shape Knots –Control points.
© University of Wisconsin, CS559 Spring 2004
Jehee Lee Seoul National University
B-Spline Blending Functions
CS 445 / 645 Introduction to Computer Graphics Lecture 22 Hermite Splines Lecture 22 Hermite Splines.
1 Introduction Curve Modelling Jack van Wijk TU Eindhoven.
Dr. S.M. Malaek Assistant: M. Younesi
1 Curves and Surfaces. 2 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized.
Q about GL to render polygon glBegin(GL_TRIANGLES) glVertex3f(0,0,0); glVertex3f(1,1,0); glVertex3f(1,0,0); glVertex3f(0,1,0); glEnd();
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
Informationsteknologi Monday, December 10, 2007Computer Graphics - Class 161 Today’s class Curve fitting Evaluators Surfaces.
Rational Bezier Curves
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 12: Spline Curves (review) Ravi Ramamoorthi Most material.
Modeling of curves Needs a ways of representing curves: Reproducible - the representation should give the same curve every time; Computationally Quick;
1. 2 The use of curved surfaces allows for a higher level of modeling, especially for the construction of highly realistic models. There are several approaches.
Geometric Modeling Surfaces Mortenson Chapter 6 and Angel Chapter 9.
Cubic Bezier and B-Spline Curves
Curves Mortenson Chapter 2-5 and Angel Chapter 9
Modelling: Curves Week 11, Wed Mar 23
RASTER CONVERSION ALGORITHMS FOR CURVES: 2D SPLINES 2D Splines - Bézier curves - Spline curves.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Curves Week 13, Mon 24 Nov 2003.
1 Representing Curves and Surfaces. 2 Introduction We need smooth curves and surfaces in many applications: –model real world objects –computer-aided.
Curve Surfaces June 4, Examples of Curve Surfaces Spheres The body of a car Almost everything in nature.
Curve Modeling Bézier Curves
Bresenham’s Algorithm. Line Drawing Reference: Edward Angel’s book: –6 th Ed. Sections 6.8 and 6.9 Assuming: –Clipped (to fall within the window) –2D.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
CS 376 Introduction to Computer Graphics 04 / 23 / 2007 Instructor: Michael Eckmann.
Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 9: Introduction to Spline Curves.
V. Space Curves Types of curves Explicit Implicit Parametric.
Curves.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Curves. First of all… You may ask yourselves “What did those papers have to do with computer graphics?” –Valid question Answer: I thought they were cool,
Chapter VI Parametric Curves and Surfaces
CS 376 Introduction to Computer Graphics 04 / 25 / 2007 Instructor: Michael Eckmann.
Basic Theory (for curve 02). 1.3 Parametric Curves  The main aim of computer graphics is to display an arbitrary surface so that it looks real.  The.
CS 445 / 645 Introduction to Computer Graphics Lecture 23 Bézier Curves Lecture 23 Bézier Curves.
Representation of Curves & Surfaces Prof. Lizhuang Ma Shanghai Jiao Tong University.
L5 – Curves in GIS NGEN06 & TEK230: Algorithms in Geographical Information Systems by: Sadegh Jamali (source: Lecture notes in GIS, Lars Harrie) 1 L5-
Curves: ch 4 of McConnell General problem with constructing curves: how to create curves that are “smooth” CAD problem Curves could be composed of segments.
Cubic Spline Interpolation. Cubic Splines attempt to solve the problem of the smoothness of a graph as well as reduce error. Polynomial interpolation.
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart.
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
CSCE 441: Keyframe Animation/Smooth Curves (Cont.) Jinxiang Chai.
(c) 2002 University of Wisconsin
Designing Parametric Cubic Curves 1. 2 Objectives Introduce types of curves ­Interpolating ­Hermite ­Bezier ­B-spline Analyze their performance.
CS 450: Computer Graphics PARAMETRIC SPLINES AND SURFACES
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
CS 325 Computer Graphics 04 / 30 / 2010 Instructor: Michael Eckmann.
College of Computer and Information Science, Northeastern UniversityFebruary 27, CS U540 Computer Graphics Prof. Harriet Fell Spring 2009 Lectures.
Computing & Information Sciences Kansas State University Lecture 30 of 42CIS 636/736: (Introduction to) Computer Graphics Lecture 30 of 42 Wednesday, 09.
Rendering Bezier Curves (1) Evaluate the curve at a fixed set of parameter values and join the points with straight lines Advantage: Very simple Disadvantages:
Curves University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner.
CS552: Computer Graphics Lecture 19: Bezier Curves.
Piecewise Polynomial Parametric Curves Sun-Jeong Kim.
Object Modeling: Curves and Surfaces CEng 477 Introduction to Computer Graphics.
Introduction to Parametric Curve and Surface Modeling.
© University of Wisconsin, CS559 Spring 2004
CS5500 Computer Graphics May 11, 2006
Curve & Surface.
Chapter 10-2: Curves.
Three Dimensional Object Representation
CURVES CAD/CAM/CAE.
Chapter XVII Parametric Curves and Surfaces
Curve design 455.
CSCE 441: Keyframe Animation/Smooth Curves (Cont.)
Introduction to Parametric Curve and Surface Modeling
Presentation transcript:

INTERPOLATION & APPROXIMATION

Curve algorithm General curve shape may be generated using method of –Interpolation (also known as curve fitting) Curve will pass through control points –Approximation Curve will pass near control points may interpolate the start and end points.

Curve algorithm interpolationapproximation

Interpolation vs approximation x f(x) x x x curve must pass through control points curve is influenced by control points

Parametric equation of line = Vector equation of a line P(t) = a + ut a u P u 2u P tutu P a u b P(t) = a + (b-a)t u = (b-a) t=0 t=1 0<=t<=1 P t=0.25 P t=0.5 P t=0.75 X(t) = a x + (b x – a x )t Y(t) = a y + (b y – a y )t Z(t) = a z + (b z – a z )t

Linear interpolation P(t) = A(1-t) + Bt In matrix form P(t) = = A B.. A B t=0 t=1 X(t) Y(t) Z(t) t1t1 in animation : - path, morphing

Interpolation Curves Curve is constrained to pass through all control points Given points P 0, P 1,... P n, find lowest degree polynomial which passes through the points x(t) = a n-1 t n a 2 t 2 + a 1 t + a 0 y(t) = b n-1 t n b 2 t 2 + b 1 t + b 0

Interpolating curve : piecewise linear Curve defined by multiple segments (linear) Segments joints known as KNOTS Requires too many data points for most shape Representation not flexible enough to editing

Interpolating curve : piecewise polynomial Segments defined by polynomial functions Segments join at KNOTS Most common polynomial used is cubic (3 rd order) Segment shape controlled by two or more adjacent control points.

Knot points Location where segments join referred to as knots Knots may or may not coincide with control points in interpolating curves.

Curve continuity Concern is continuity at knots. Continuity conditions –Point continuity (no slope or curvature restriction / no gap) –Tangent continuity (same slope at knot) –Curvature continuity ( same slope and curvature at knot)

Continuity - C n –C 0 continuity – continuity of endpoint only or continuity of position. –C 1 continuity is tangent continuity or first derivative of position –C 2 continuity is curvature continuity or second derivative of position. Curve continuity

C0C0 C1C1 C2C2

Interpolation curves Typically possess curvature continuity Shape defined by –Endpoint and control point location –Tangent vectors at knots –Curvature at knots

Interpolation vs. Approximation Curves Interpolation Curve – over constrained → lots of (undesirable?) oscillations Approximation Curve – more reasonable?

Approximation techniques Developed to permit greater design flexibility in the generation of free form curves Common methods in modern CAD systems, bezier, b-spline, NURBS Employ control points (set of vertices that approximate the curve)

Curves do not pass directly through points (except start and end) Intermediate points affect shape as if exerting a “pull” on the curve. Allow user to set shape by “pulling” out curve using control point location. Approximation techniques

Example – bezier curve

Cubic Bézier Curve 4 control points Curve passes through first & last control point Curve is tangent at P 1 to (P 1 -P 2 ) and at P 4 to (P 4 -P 3 )