{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Doing all edges the polygon is fully clipped

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping: The Algorithm Basic idea: • Consider each edge of the viewport individually • Clip the polygon against the edge equation • After doing all edges, the polygon is fully clipped Sutherland-Hodgeman Clipping Input/output for algorithm: • Input: list of polygon vertices in order Input: • Output: list of clipped poygon vertices consisting of Output: old vertices (maybe) and new vertices (maybe) old Note: this is exactly...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online