A
Q. 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 - Option(C)
- Views: 19
- Filed under category Computer Graphics
- Hashtags:
Discusssion
Login to discuss.