Weiler-Atherton clipping algorithm

Show Summary Details

Quick Reference

A polygon-clipping algorithm that is capable of clipping a concave polygon with interior holes to the boundaries of another concave polygon also with interior holes. (A concave polygon has an interior angle greater than 180°.) It is thus more general, though more complex, than the Sutherland—Hodgman clipping algorithm.

Subjects: Computing.

Reference entries

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