Explain Sutherland Hodgeman algorithm for polygon clipping?

92kviews

written 9.4 years ago by

prof.vaibhavbadbe • 1.7k

modified 5.6 years ago by

sanketshingote • 100

computer graphics

ADD COMMENT EDIT

3 Answers

5.0kviews

written 7.8 years ago by

prof.vaibhavbadbe • 1.7k

Sutherland-Hodgeman Polygon Clipping Algorithm:-

A polygon can be clipped by processing its boundary as a whole against each window edge. This is achieved by processing all polygon vertices against each clip rectangle boundary in turn. beginning with the original set of polygon vertices, we could first clip the polygon against …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

628views

written 9.4 years ago by

prof.vaibhavbadbe • 1.7k

We can correctly clip a polygon by processing the polygon boundary as a whole against each window edge. This could be accomplished by processing all polygon vertices against each clip rectangle boundary in turn. Beginning with the initial set of polygon vertices, we could first clip the polygon against the …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

644views

written 7.0 years ago by

prof.vaibhavbadbe • 1.7k

modified 7.0 years ago by

585rahulkumar • 0

Excellent Explaining

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.