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. 


Comments

Popular posts from this blog

Missionaries & Canibal Problem in AI using Pro Log

 A Complete Guide to Understanding JWT and Implementing It in Your Applications

The Sneaky PostgreSQL Bug That Cost Me 3 Hours (And How to Fix It in 3 Minutes)