Important points about the bezier curves, Computer Graphics

Important points about the bezier curves - modeling and rendering

1) Generalizing the idea of Bezier curve of degree at n based upon n+1 control point p0,.....pn

P(0)= P0

P(1) =pn

Values of parametric initial derivates of Bezier curve at the ending points can be computed from control point Coordinates are:

P'(0) = -nP0 +n P1

P'(1) = -nPn-1 +  nPn

Hence, the slope at the starting of the curve is beside the line joining two control points and the slope on the end of the curve is beside the line connecting the last two endpoints.

2) Convex hull: For 0≤ t ≤ 1, the Bezier curve lies completely in the convex hull of its control points. This property for a Bezier curve ensures about polynomial will not contain erratic oscillation.

3) Bezier curves are invariant about affine transformations, although they are not invariant about projective transformations.

4) To the Bezier curve, the vector tangent at the beginning or stop is parallel to the line connecting the first two or last two control points.

5) Bezier curves appear a symmetry property: The similar Bezier curve shape is acquired if the control points are considered in the opposite order. The merely difference will be the parametric way of the curve. The direction of rising parameter reverses while the control points are considered in the reverse sequence.

6) Adjusting the location of a control point changes the shape of the curve in a "predictable manner". Spontaneously, the curve "follows" the control point.

Posted Date: 4/4/2013 5:29:01 AM | Location : United States







Related Discussions:- Important points about the bezier curves, Assignment Help, Ask Question on Important points about the bezier curves, Get Answer, Expert's Help, Important points about the bezier curves Discussions

Write discussion on Important points about the bezier curves
Your posts are moderated
Related Questions
Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

1. Use the outline method to plot the following font boundaries (style should remain the same). Implement your method in C language.    ANswer: Here letter G is produced

Assumption for Diffuse Reflection - Polygon Rendering  i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie


Containment Test -  visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The

Interlaced GIF: The conventional which is non-interlaced GIF graphic downloads one line of pixels at one time from top to bottom and browsers display all lines of the image as it

explain cohen sutherland line clipping algorithm

Perform the indicated base conversions 548 to base 5

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

why there is coating of phosphorous on CRT screen?