We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2
• .
Computer graphics is an art of drawing pictures on computer screens with the
help of progTamming. 2. It involves computation, creation, manipulation of data. 3. Computer graphics is a rendering tool for the generation and manipulation of images. Applications of computer graphics: 1 Graphical User Interface (GU) : Computer graphics tools are used to make GUI. 2 Computer arts: Computer graphics are used in designing object shapes and specifying object such as cartoon drawing, logo design. 3. Education and training: Computer generated models of physical financial and economic systems are used as educational aids. Learning with visual aids is fast, easy to understand and cost effective. Entertainment: Graphics and image processing techniques can be used to transform an object into another object. 5. Visualization: Visualization is used to convert large data value into patterns, charts, graphs, etc., with the help of computer graphics. 6 Presentation graphics: With the help of computer graphies large volumes of business data can be presented easily, making it attractive and useful. • Clipping: 1. Clipping is the procedure that identifies those portions of a pieture that are either inside or outside of a specific region of space. 2 3 The region against which an object is to be clipped is called clipping Point, line, area or text can be clipped. window. Windowing: 1 Windowing is the process of selecting and viewing the pieture with different views. 2. An area on a display device to which a window is mapped is called a viewport. 3. A window and viewports are rectangle in standard position, with the rectangle edges parallel to coordinate axis. • B-spline curves : 1. B-spline is basis spline function which contains a set of control points. 2. B-spline function is a combination of flexible band that passes through the number of control points and creates a smooth,curve. 3. Each vertex affects the shape of the curve only over a range of parameter values where its associated basis function is non-zero. • 4. The B-spline is non-global because each vertex B, is associated with a unique basis function. 5. 1f Pu) be the position vectors along the curve as a function of the parameter u, a B-spline curve is given by Plu) = 2P, Bau), min u smax 2sd Sn +1 where the p, is an input set of n + 1 control points. • Properties of B-splines curve: 1 The polynomial curve has degree d-1 and C% continuity over the range of u. 2 For n + 1 control points, the curve is described with n + 1 blending functions. 3. Each blending function B, is defined over d subintervals of the total range of u, starting at knot value u 4. The range of parameter u is divided into n +d subinterval by the n +d+1values specified in the knot vector. 5. Each section of spline curve is influenced by d control points. 6. Any one control point can affect the shape of at most d curve sections. 7. For any value of u in the interval from knot value ug-1 to u,.1 the sum over all basic function is I: • Bezier curves: 1. A Bezier curve section can be filled to any number of control points. 2. The number of control points to be approximated and their relative position determine the degree of Bezier polynomial. 3. Bezier curve can be specified with boundary conditions with a characterizing matrix or with blending functions. 4. For general Bezier curves, the blending function specification is most convenient. 5. Suppose we are given n + 1 control points position:P = ( Jp 2) with kvarying from 0 to n. • 6. These coordinate point can be blended to produce the following position vector Plu), which describes the path of an approximation Bezier polynomial function between Po and P • Properties of Bezier curves : Bezier curve always passes through the first and last control points i.e., curve has same end points as the guiding polygon. 2. The degree of the polynomial defining the curve segment is one less than the number of defining polygon point. Therefore, for four control points, the degree of the polynomial is three, i.e., cubic polynomal. 3. The direction of the tangent vector at the end points is the same as that of the vector determined by first and last segments. The curve lies entirely within the convex hull formed by four control points.