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 (Solved)
1. store interaction point of line ps (s’) only
2. store point p and s’
3. store point p only
4. store points s and s’
- a. store interaction point of line ps (s’) only