Q.

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

A. store interaction point of line ps (s’) only
B. store point p and s’
C. store point p only
D. store points s and s’
Answer» A. store interaction point of line ps (s’) only
914
0
Do you find this helpful?
1

View all MCQs in

Computer Graphics

Discussion

No comments yet

Related MCQs