Extra Education
← All Computer Graphics questions
1

In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should

Correct Answer: store point p only

Make the most of this question

This page focuses on one Computer Graphics question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Computer Graphics MCQsAll Engineering topicsMock test hub
Computer Graphics MCQ: In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should | Extra Education