Mumbai University > Computer Engineering > Sem 6 > Computer Graphics

Marks: 10 Marks

Year: Dec 2016

1. Sutherland-Hodgeman algorithm requires a convex polygon.
2. In context of many applications, e.g., hidden surface removal, the ability to clip the concave polygon is required. A powerful but somewhat more complex clipping algorithm developed by Weiler and Atherton meets this requirement.
3. This algorithm defines the polygon to be clipped as a …