Sutherland-Hodgman clipping algorithm

Show Summary Details

Quick Reference

A polygon-clipping algorithm in which the fundamental idea is to clip the original polygon and each resulting intermediate polygon against each edge of the clipping region in succession. The algorithm allows any planar or nonplanar polygon to be clipped to a convex clipping volume.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.