Ask
Login
0
1.6kviews
Write the Sutherland-Hodgeman polygon clipping algorithm. Explain the modification given by Weiler and Atherton for a concave polygon.
written 3.5 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k •   modified 3.5 years ago

Write the Sutherland-Hodgeman polygon clipping algorithm. Explain the modification given by Weiler and Atherton for a concave polygon.
computer graphics
ADD COMMENT EDIT
1 Answer
0
58views
written 3.5 years ago by gravatar for Krishna_Agrawal Krishna_Agrawal • 2.7k


Sutherland-Hodgeman polygon clipping algorithm :-

  1. Read coordinates of all vertices of the polygon.
  2. Read coordinates of the clipping window.
  3. Consider the left edge of the window.
  4. Compare the vertices of each edge of the polygon, individually with the clipping plane.
  5. Save the resulting intersections and vertices in the new list …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.