Scribd Logo
Upload

Welcome to Scribd!

  • R7310503 Computer Graphics

    Uploaded by

    sivabharathamurthy
    4 views1 page
    The document is an exam for a Computer Graphics course consisting of 8 questions covering various topics in computer graphics including: 1) Methods for generating electronic images in fine arts and the beam-penetration method for color pictures. 2) Properties of ellipses and the mid-point ellipse algorithm. 3) Deriving transformation matrices for 2D transformations, scaling, and shear transformations. 4) How the Sutherland-Hodgeman polygon clipping algorithm works and why it only works for convex regions. 5) Calculating the reflected ray vector and angle given surface normals, light, and sight vectors. 6) Various viewing coordinates and 3D clipping in detail.

    Original Description:

    QP

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is an exam for a Computer Graphics course consisting of 8 questions covering various topics in computer graphics including: 1) Methods for generating electronic images in fine arts and the beam-penetration method for color pictures. 2) Properties of ellipses and the mid-point ellipse algorithm. 3) Deriving transformation matrices for 2D transformations, scaling, and shear transformations. 4) How the Sutherland-Hodgeman polygon clipping algorithm works and why it only works for convex regions. 5) Calculating the reflected ray vector and angle given surface normals, light, and sight vectors. 6) Various viewing coordinates and 3D clipping in detail.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    R7310503 Computer Graphics

    Uploaded by

    sivabharathamurthy
    The document is an exam for a Computer Graphics course consisting of 8 questions covering various topics in computer graphics including: 1) Methods for generating electronic images in fine arts and the beam-penetration method for color pictures. 2) Properties of ellipses and the mid-point ellipse algorithm. 3) Deriving transformation matrices for 2D transformations, scaling, and shear transformations. 4) How the Sutherland-Hodgeman polygon clipping algorithm works and why it only works for convex regions. 5) Calculating the reflected ray vector and angle given surface normals, light, and sight vectors. 6) Various viewing coordinates and 3D clipping in detail.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Code: R7310503 B.

    Tech III Year I Semester (R07) Supplementary Examinations, May 2013 COMPUTER GRAPHICS
    (Common to CSE, IT, CSS and ECC)

    R7

    Time: 3 hours Answer any FIVE questions All questions carry equal marks
    *****

    Max Marks: 80

    1 (a) (b) 2 3 (a) (b) 4

    Explain about various methods for generating electronic images in the fine arts. Explain about beam-penetration method for displaying color pictures. What are the properties of ellipses? Explain mid-point ellipse algorithm. Derive transformation matrix for 2D transformation and scaling about origin. Derive transformation matrix for shear transformation. Explain how Sutherland-Hodgeman polygon clipping algorithm works. Also, explain why it works for only convex clipping regions. At a surface point P, if the surface normal, light vector and sight vectors are given by N = j, L = -i + 2j - k and S = i + 1.5j + 0.5k respectively. Find the vector of reflected ray and the angle it is making with surface normal. Write about various viewing co-ordinates. Write about 3D clipping in detail. Write a program to display visible surfaces of a convex polyhedron using the BSPtree method. Write different advantages and disadvantages of computer animation languages.

    6 (a) (b) 7

    *****

    You might also like