A

Admin • 833K Points
Coach

Q. 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

  • (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’

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.