R31054 R10 COMPUTER GRAPHICS JNTU ?· III B.Tech I Semester Supplementary Examinations, May/June - 2015…

Download R31054 R10 COMPUTER GRAPHICS JNTU ?· III B.Tech I Semester Supplementary Examinations, May/June - 2015…

Post on 01-Aug-2018

212 views

Category:

Documents

0 download

TRANSCRIPT

  • |''|''|||''|'''|||'|

    III B.Tech I Semester Supplementary Examinations, May/June - 2015

    COMPUTER GRAPHICS

    (Common to CSE & IT)

    Time: 3 hours Max. Marks: 75

    Answer any FIVE Questions

    All Questions carry equal marks

    *****

    1 a) Explain about the simple raster Scan display system. [8]

    b) Explain the basic operations of direct view storage tube. [7]

    2 a) Discuss in detail about parallel line algorithms. [8]

    b) Explain the even-odd method of determining the polygon interior points. [7]

    3 a) Derive mathematically, the transformation that rotates an object point 0 anti-

    clockwise, about the origin. Write the matrix representation for this rotation.

    [7]

    b) Show that the two successive rotations about the origin are commutative. [8]

    4 a) Explain the various approaches followed in different line-clipping algorithms. [7]

    b) What is the principle of Cyrus-Beck algorithm for clipping a polygon? [8]

    5 a) Define the blending function for B-Spline curve. [7]

    b) List out and explain various polygon rendering methods. [8]

    6 a) Differentiate between parallel and perspective projections. [7]

    b) Explain in brief about 3D viewing pipeline. [8]

    7 a) What are the steps involved in depth buffer algorithm? [7]

    b) Explain in brief about the Warnock's algorithm? [8]

    8 a) What are the various types of interpolation used in animation? [7]

    b) Define animation? What are the characteristics of key frame animation? [8]

    *****

    Code No: R31054 Set No. 1 R10

    JNTU

    Worl

    d

  • |''|''|||''|'''|||'|

    III B.Tech I Semester Supplementary Examinations, May/June - 2015

    COMPUTER GRAPHICS

    (Common to CSE & IT)

    Time: 3 hours Max. Marks: 75

    Answer any FIVE Questions

    All Questions carry equal marks

    *****

    1 a) Define Computer Graphics? Explain in brief about applications of computer graphics? [8]

    b) Explain in brief the advantages and disadvantages of DVST.

    [7]

    2 a) What are the steps involved in the edge fill algorithm. [8]

    b) Draw the flow chart for Bressenhams ellipse generation algorithm.

    [7]

    3 a) Write the general form of a scaling matrix with respect to a fixed point P(h,k) where

    the scaling factors in x and y directions are a and b respectively.

    [8]

    b) Show how shear transformations may be expressed in terms of rotation and scaling.

    [7]

    4 a) Explain the working of the Sutherland-Hodgeman algorithm for polygon clipping with

    the help of suitable example.

    [8]

    b) Compare Liang Barsky algorithm with Cohen Sutherland algorithm.

    [7]

    5 a) Derive the transformation illumination model that combines diffuse and specular

    reflections.

    [8]

    b) Differentiate between Bezier curve and B-Spline curve.

    [7]

    6 a) Derive the perspective projection transformation matrix. [8]

    b) b) Explain in brief about the working process of 3D clipping.

    [7]

    7 a) Explain about the Back Face detection algorithm. What are the limitations of the Back

    Face detection method?

    [8]

    b) Explain about the BSP-TREE method.

    [7]

    8 a) Define animation? Explain in brief about computer animation functions? [8]

    b) Explain in brief about Motion specifications. [7]

    *****

    Code No: R31054 Set No. 2 R10

    JNTU

    Worl

    d

  • |''|''|||''|'''|||'|

    III B.Tech I Semester Supplementary Examinations, May/June - 2015

    COMPUTER GRAPHICS

    (Common to CSE & IT)

    Time: 3 hours Max. Marks: 75

    Answer any FIVE Questions

    All Questions carry equal marks

    *****

    1 a) Explain about the Bressen hams line generation algorithm. [8]

    b) Describe the working principle of plotter.

    [7]

    2 a) Describe the advantages of scan line fill method over the flood fill method. [7]

    b) Draw the flow chart for midpoint circle generation algorithm.

    [8]

    3 a) Show that a rotation about the origin can be done by performing three shearing

    Transformations

    [8]

    b) What is the need of homogeneous coordinates? Give the homogeneous coordinates for translation, rotation and scaling.

    [7]

    4 a) Explain about the midpoint sub division line clipping algorithm. [7]

    b) Derive the window to view port transformations equations by first scaling the window to the size of the view port and then translating the scaled window to the view port position.

    [8]

    5 a) Derive the transformation matrix for Hermite curve. [8]

    b) Describe the characteristics of the following parameters.

    i) Diffuse Reflection, ii) Specular Reflection iii) Refraction.

    [7]

    6 a) Derive the transformation matrix for rotation about an x-axis in 3D. [7]

    b) Compare the orthographic and oblique types of parallel projections and also Explain the various clipping parameters in 3D clipping.

    [8]

    7 a) Explain about the painters algorithm. Explain the situation where the painters algorithm does not work properly.

    [8]

    b) Explain in brief about octree methods.

    [7]

    8 a) What is morphing? How is a shape converted into another shape by morphing? [7]

    b) Describe the techniques to achieve the simple animation effects. [8]

    *****

    Code No: R31054 Set No. 3 R10

    JNTU

    Worl

    d

  • |''|''|||''|'''|||'|

    III B.Tech I Semester Supplementary Examinations, May/June - 2015

    COMPUTER GRAPHICS

    (Common to CSE & IT)

    Time: 3 hours Max. Marks: 75

    Answer any FIVE Questions

    All Questions carry equal marks

    *****

    1 a) Describe about the flat panel display devices. [8]

    b) Differentiate random scan and raster scan methods.

    [7]

    2 a) Explain about the flood fill algorithm for filling polygons. [8]

    b) Write an algorithm of Bressenhams circle generating algorithm.

    [7]

    3 a) Find the normalization transformation N which uses the rectangle A(1,1) B(5,3) C(4,5) and D(0,3 as a window and the normalized device screen as the view port .

    [7]

    b) Show that a rotation about the origin can be done by performing three shearing Transformations.

    [8]

    4 a) Draw the flow chart for Cohen Sutherland algorithm. [8]

    b) Derive the window to view port transformations equations by first scaling the window to the size of the viewport and then translating the scaled window to the view port position.

    [7]

    5 a) Explain about Hermite curve with equations and examples. [6]

    b) Differentiate between polygon surfaces and quadric surfaces. [6]

    c) Define B-spline Curve.

    [3]

    6 a) Differentiate between shear and composite transformation. [8]

    b) Give a flow chart for Sutherland Hodgeman algorithm polygon clipping.

    [7]

    7 a) Differentiate between the object space and image space hidden surface algorithms. [7]

    b) Compare the ray casting met hod with the Z-buffer method.

    [8]

    8 a) Explain the Lamberts principle. [8]

    b) Define Animation? Explain about the computer animation. [7]

    *****

    Code No: R31054 Set No. 4 R10

    JNTU

    Worl

    d

Recommended

View more >