Follow Us :

CGGO Q9

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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *