Algorithm  Take input edges (Edges contain two vertices ) successively for a given polygon. Output is a new vertices Don’t panic see the description of wonderful explanation.  https://youtube.googleapis.com/v/Yo2mdg-k41w&source=uds //pagead2.googlesyndication.com/pagead/show_ads.js Continue reading CLIPPING POLYGONS : SUTHERLAND-HODGMAN’S PLOYGON-CLIPPING ALGORITHM