B-spline curves - uniform b-splines and de boor algorithm, Computer Graphics

Assignment Help:

B-spline curves are piecewise smooth polynomial curves. 

  • B-spline curves are defined over an interval which has been partitioned into sub-intervals. On each subinterval B-spline curve reduces to a polynomial curve. The curve pieces are joined in such a way that the composite curve satisfies certain smoothness conditions specified in terms of matching of derivatives of certain orders. Points defining the partition of the interval are called knots or knot points. This is because at this common domain point of the interval, two polynomial curve segments are joined to make the composite curve.
  • B-spline curves as well as blending functions are computed using the iterative de Boor algorithm.
  • B-splines satisfy the important properties suitable for geometric modellling in computer Graphics. Some of these include (i) local control (ii) smoothness (iii) degree of spline curve does not depend on the number of control points (iv) convex hull property (v) convenient blending functions.
  • Uniform B-splines are B-spline curves with uniform spacing between the knots.
  • Uniform B-splines give periodic blending functions. This means all blending functions are translated versions of a single B-spline.

Related Discussions:- B-spline curves - uniform b-splines and de boor algorithm

What happens while two polygons have similar z value , What happens while t...

What happens while two polygons have similar z value and the z-buffer algorithm is utilized? Solution : z-buffer algorithms, varies colors at a pixel if z(x,y)

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

Important point about the de casteljeau algorithm, Important point about th...

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Definitions of hypertext, Definitions of Hypertext A manner of pre...

Definitions of Hypertext A manner of presenting information online along with links among one piece of information and the other. These links are termed as hypertext links

Multimedia business, Multimedia Business: Even fundamental office app...

Multimedia Business: Even fundamental office applications as a MS word processing package or a MS Excel spreadsheet tool turns into a powerful tool along with the aid of mult

Bresenham rasterisation algorithm, 2. Describe how the Bresenham rasterisat...

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Introduction of 2-d and 3-d transformations, Introduction of 2-D and 3-D  ...

Introduction of 2-D and 3-D  Transformations In this, the subsequent things have been discussed in detail as given below: Different geometric transformations as transla

Differentiate between raster and vector images, QUESTION a) Differentia...

QUESTION a) Differentiate between raster and vector images. b) Explain the concept of bit depth. What is the minimum number if bits required for a one-colour digital image t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd