Computer
Graphics
Lecture 15
Docsity.com
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Polygon Clipping - Computer Graphics - Lecture Slides, Slides of Computer Graphics
Polygon Clipping, Sequence of vertices and edges, Sutherland Hodgeman clipping algorithm, Weiler Atherton clipping algorithm, Steps of Algorithm, Cases of Polygon Clipping terms are which we learned in this lecture.
Typology: Slides
2011/2012
1 / 41
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Polygon Clipping - Computer Graphics - Lecture Slides and more Slides Computer Graphics in PDF only on Docsity!
Computer
Graphics
Lecture 15
CLIPPING II
Sutherland-Hodgeman
clipping algorithm
clips any polygon against a
convex clip polygon.
Weiler-Atherton
clipping algorithm
Weiler-Atherton clipping
algorithm clips any polygon
against any clip polygon. The
polygons may even have holes.
Polygon clipping - open polygons.
Polygon clipping - open polygons.
Four clip edges, each
defining one boundary of the
clip rectangle, successively
clip a polygon against a clip
rectangle.
Steps of Algorithm
Polygons can be clipped against each edge of the window one at a time. Vertices which are kept after clipping against one window edge are saved for clipping against the remaining edges.