Scribd Logo
Upload

Welcome to Scribd!

  • Module 3

    Uploaded by

    Pramathesh Bhakta
    5 views18 pages
    Cohen-Sutherland line clipping algorithm clips a line segment against a rectangular window. It analyzes clipping the line segment from P1(40,15) to P2(75,45) against the window defined by points A(50,40), B(60,10), C(80,10), and D(80,40). Sutherland-Hodgman polygon clipping algorithm clips a polygon against a clip window by dividing the polygon's edges at the clip window's boundaries and discarding the hidden portions of the polygon outside the window. The RGB and CMY color models are inverse transformations of each other. RGB uses additive color mixing by combining red, green, and blue

    Original Description:

    Original Title

    CG M3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Cohen-Sutherland line clipping algorithm clips a line segment against a rectangular window. It analyzes clipping the line segment from P1(40,15) to P2(75,45) against the window defined by points A(50,40), B(60,10), C(80,10), and D(80,40). Sutherland-Hodgman polygon clipping algorithm clips a polygon against a clip window by dividing the polygon's edges at the clip window's boundaries and discarding the hidden portions of the polygon outside the window. The RGB and CMY color models are inverse transformations of each other. RGB uses additive color mixing by combining red, green, and blue

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views18 pages

    Module 3

    Uploaded by

    Pramathesh Bhakta
    Cohen-Sutherland line clipping algorithm clips a line segment against a rectangular window. It analyzes clipping the line segment from P1(40,15) to P2(75,45) against the window defined by points A(50,40), B(60,10), C(80,10), and D(80,40). Sutherland-Hodgman polygon clipping algorithm clips a polygon against a clip window by dividing the polygon's edges at the clip window's boundaries and discarding the hidden portions of the polygon outside the window. The RGB and CMY color models are inverse transformations of each other. RGB uses additive color mixing by combining red, green, and blue

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 18

    Module-3

    13. What is clipping? Explain Cohen-Sutherland Line Clipping Algorithm , Analyze the Cohen
    Sutherland line clipping algorithm P1 (40,15) P2(75,45) against window A(50,40) B(60,10)
    C(80,10) D(80,40).
    OR
    Problem:
    Cohen Sutherland line clipping algorithm P1 (40,15) P2(75,45) against window A(50,40)
    B(60,10) C(80,10) D(80,40).
    14. Explain Sutherland-Hodgman polygon clipping,Find the final clipped vertices using the
    Sutherland Hodgman Polygon clipping Algorithm (STAR DIAGRAM IN QUESTION)
    ONE MORE EXAMPLE:
    15. Compare RGB and CMY color models. Explain the transformation between CMY and RGB
    color specs.
    16. Explain the different types of light sources supported by OpenGL
    OR
    16.Explain the depth buffer method and give the openGL visibility detection Functions.
    CHECK FOR ANS PLZ

    17. In Computer Graphics, discuss the different types of light sources used in rendering and
    their characteristics. Explain the concept of specular reflection and its significance in
    achieving realistic shading. Finally, delve into the Phong illumination model, detailing how it
    combines diffuse and specular reflection components to calculate the final color of a pixel in a
    3D scene (VBQ)

    You might also like