Section outline

  • Week – 11: Topics for Discussion


    Lecture 16: 2-D Clipping, Polygon Clipping Algorithm: Sutherland Hodgeman 

    Lecture 17: 2-D Clipping, Polygon Clipping and Clipping Algorithm


    Expected Learning Outcome:

    • Able to understand the core concept of output primitives and transformation
    • Able to implement the algorithm rendering the graphics


    • Students must
      Mark as done

      Curves - 1


    • Students must
      Mark as done

      Curves - 2

    • Students must
      Mark as done

      Curves - 3 and 

      Curves - 4

    • Students must
      Mark as done

      Curves and Surfaces Full Slides

    • Students must
      Mark as done

      Class Video on 21 July 2020 PC-A

    • forum icon
      Discussion Forum
      Students must
      Mark as done

      Forum activities are very much important for students to engage them in discussion.

      Every student must share his/her idea in this forum.

      At least one question and one answer must be put here to prove the participation.

      It is evaluated and considered for upgrading the points.

      Last date of participation is 28 July 2020.