Anupam Saxena Associate Professor Indian Institute of Technology KANPUR 208016.

Slides:



Advertisements
Similar presentations
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Advertisements

Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Lecture 14 Curves and Surfaces II
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
ICS 415 Computer Graphics B-Spline curves (Chapter 8)
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Overview June 9- B-Spline Curves June 16- NURBS Curves June 30- B-Spline Surfaces.
1 Introduction Curve Modelling Jack van Wijk TU Eindhoven.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
CS CS 175 – Week 9 B-Splines Blossoming, Bézier Splines.
CS CS 175 – Week 9 B-Splines Definition, Algorithms.
Rational Bezier Curves
CS CS 175 – Week 8 Bézier Curves Definition, Algorithms.
Modeling of curves Needs a ways of representing curves: Reproducible - the representation should give the same curve every time; Computationally Quick;
1 Dr. Scott Schaefer The Bernstein Basis and Bezier Curves.
1 Dr. Scott Schaefer Catmull-Rom Splines: Combining B-splines and Interpolation.
Bezier and Spline Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
Modelling: Curves Week 11, Wed Mar 23
Bspline Notes Jordan Smith UC Berkeley CS184. Outline Bézier Basis Polynomials –Linear –Quadratic –Cubic Uniform Bspline Basis Polynomials –Linear –Quadratic.
RASTER CONVERSION ALGORITHMS FOR CURVES: 2D SPLINES 2D Splines - Bézier curves - Spline curves.
Bezier and Spline Curves and Surfaces CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
CS Subdivision I: The Univariate Setting Peter Schröder.
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Curve Modeling B-Spline Curves
Computer Graphics Through OpenGL: From Theory to Experiments, Second Edition Chapter 16.
(Spline, Bezier, B-Spline)
V. Space Curves Types of curves Explicit Implicit Parametric.
Introduction to Computer Graphics with WebGL
1 Dr. Scott Schaefer Blossoming and B-splines. 2/105 Blossoms/Polar Forms A blossom b(t 1,t 2,…,t n ) of a polynomial p(t) is a multivariate function.
Review of Interpolation. A method of constructing a function that crosses through a discrete set of known data points.
Splines Vida Movahedi January 2007.
NUBS by Brian Wyvill What’s that?. University of Calgary GraphicsJungle Project ENEL 555 B-Splines page 2 Uniform B-Splines Basis functions for B-Splines.
Spline curves with a shape parameter Reporter: Hongguang Zhou April. 2rd, 2008.
Sullivan Algebra and Trigonometry: Section R.4 Polynomials Objectives of this Section Recognize Monomials Recognize Polynomials Add, Subtract, and Multiply.
Chapter 9.1 Notes: Add and Subtract Polynomials Goal: You will add and subtract polynomials.
8-1 Adding and Subtracting Polynomials. Degree of a monomial: is the sum of the exponents of its variables. The degree of a nonzero constant is 0. Zero.
Splines IV – B-spline Curves based on: Michael Gleicher: Curves, chapter 15 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
On the degree elevation of B-spline curves and corner cutting Guozhao Wang,Chongyang Deng Reporter : Jingjing Yu.
Keyframing and Splines Jehee Lee Seoul National University.
Representation of Curves & Surfaces Prof. Lizhuang Ma Shanghai Jiao Tong University.
6.1 Review of the Rules for Exponents
Parametric Curves CS 318 Interactive Computer Graphics John C. Hart.
15.10 Graphing Polynomial Functions OBJ:  To sketch the graph of an integral polynomial function of degree n with n distinct roots.
Section 8-6 Testing a Claim about a Standard Deviation or Variance.
THOERY OF MECHANISMS AND MACHINES
THOERY OF MECHANISMS AND MACHINES Module-05 Velocity & Acceleration Analysis Instructed by: Dr. Anupam Saxena Associate Professor Department of Mechanical.
Blossoms CS 419 Advanced Topics in Computer Graphics John C. Hart
Surface Modeling Parametric Surfaces Dr. S.M. Malaek Assistant: M. Younesi.
Kansas State University Department of Computing and Information Sciences CIS 736: Computer Graphics Lecture 13 of 42 Wednesday, 15 February 2006 William.
Curves University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner.
CS552: Computer Graphics Lecture 19: Bezier Curves.
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Introduction to Parametric Curve and Surface Modeling.
Lecture 2 Linear Inverse Problems and Introduction to Least Squares.
THOERY OF MECHANISMS AND MACHINES Module-10 CAMS (DESIGN) Instructed by: Dr. Anupam Saxena Associate Professor Department of Mechanical Engineering Indian.
B(asis)-Splines Ashish Myles CISE, UF. Splines ● Piecewise polynomial ● More flexible than single polynomials – can have finite support – can be periodic.
Addition, Subtraction, and Multiplication of Polynomials
Lecture 22: B Spline Curve Properties
(Spline, Bezier, B-Spline)
The Bernstein Basis and Bezier Curves
Spline Interpolation Class XVII.
Curve design 455.
Lecture 21: B Spline Curve
PPT2: B-spline Basics Functions
Introduction to Parametric Curve and Surface Modeling
Polynomial Functions and Models
Overview June 9- B-Spline Curves June 16- NURBS Curves
Presentation transcript:

Anupam Saxena Associate Professor Indian Institute of Technology KANPUR

N k, i (t) = (t i  t i  k )M k, i (t) More popular

N 1, i (t) =  i such that  i = 1 for t  [t i  1, t i ) = 0, elsewhere

N k, i (t) is a degree k  1 polynomial in t Non-negativity: For all i, k and t, N k, i (t) is non-negative In a given knot span t i  k < t i  k +1 < …< t i N 1, i (t) = 1, for t  [t i  1, t i ); = 0, elsewhere N 1, i (t)  0 in [t i  k, t i ) N 1, i  2 (t) = 1, for t  [t i  3, t i  2 ); = 0, elsewhere N 1, i  1 (t) = 1, for t  [t i  2, t i  1 ); = 0, elsewhere N 1, i  1 (t)  0 and N 1, i  2 (t)  0 in [t i  k, t i )

t  [t i  2, t i ) and = 0, elsewhere for t  [t i  2, t i  1 ) for t  [t i  1, t i ) N 2, i (t)  0 for t in [t i  2, t i ) Perform induction to prove for N k,i (t)

04123 N 1,1 (t)N 1,2 (t)N 1,3 (t)N 1,4 (t) N 2,2 (t) N 2,3 (t) N 3,3 (t) N 3,4 (t) N 4,4 (t)

N k,i (t) is a non-zero polynomial in (t i  k, t i ) On any span [t i, t i+1 ), at most p order p normalized B-Splines are non-zero titi t i+1 t i+2 t i+3 t i+4 t i-1 t i-2 t i-3 t i-4 t N 4,i+1 (t) N 4,i+2 (t)N 4,i+3 (t) N 4,i+4 (t) For any r, N p,r (t) ≥ 0 in the knot span [t r  p, t r ) If [t i, t i+1 ) is contained in [t r  p, t r ), there should be one order p B-spline with t i as the first knot and one with t i+1 as last knot r  p = i and r = i+1 provide the ranger = i+1, …, i+pp splines provides local control for B-spline curves

Partition of Unity: The sum of all non-zero order p basis functions over the span [t i, t i+1 ) is 1 titi t i+1 t i+2 t i+3 t i+4 t i-1 t i-2 t i-3 t i-4 t N 4,i+1 (t) N 4,i+2 (t)N 4,i+3 (t) N 4,i+4 (t) B-spline basis functions add to unity within a subgroup Not all B-spline basis functions add to one as opposed to Bernstein polynomials

For number of knots as m+1 and the number of degree p–1 basis functions as n+1, m = n + p The first normalized spline on the knot set [t 0, t m ) is N p,p (t) the last spline on this set is N p,m (t) m  p+1 basis splinesn+1 = m  p+1 Multiple knots If a knot t i appears k times (i.e., t i  k+1 = t i  k+2 =... = t i ), where k > 1, t i is termed as a multiple knot or knot of multiplicity k for k = 1, t i is termed as a simple knot Multiple knots can significantly change the properties of basis functions and are useful in the design of B-spline curves

N 3,i (t) At a knot i of multiplicity k, the basis function N p i (t) is C p  1  k continuous at that knot

N 3,i (t) Symmetricity is maintained when knots are moved to the left

At each internal knot of multiplicity k, the number of non-zero order p basis functions is at most p  k N 4,i-1 t i-4 t i-1 t i-5 t i-2 t i-6 t i-3 t i-7 N 4,i-2 N 4,i-3 non-zero splines over a simple knot t i  4 p  k = 4  1 = 3 non-zero splines over a double knot t i  4 p  k = 4  2 = 2 non-zero splines over a triple knot t i  4 p  k = 4  3 = 1 non-zero splines over a quadruple knot t i  4 p  k = 4  4 = 0