CLIPPING POLYGONS : SUTHERLAND-HODGMAN’S PLOYGON-CLIPPING ALGORITHM

Algorithm 
  1. Take input edges (Edges contain two vertices ) successively for a given polygon.
  2. Output is a new vertices
Don’t panic see the description of wonderful explanation. 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s