- Geometric algorithms
- >
- Computer graphics algorithms
- >
- Clipping (computer graphics)
- >
- Polygon clipping algorithms

Greiner–Hormann clipping algorithm

The Greiner-Hormann algorithm is used in computer graphics for polygon clipping. It performs better than the Vatti clipping algorithm, but cannot handle degeneracies. It can process both self-intersec

Weiler–Atherton clipping algorithm

The Weiler–Atherton is a polygon-clipping algorithm. It is used in areas like computer graphics and games development where clipping of polygons is needed. It allows clipping of a subject or candidate

Sutherland–Hodgman algorithm

The Sutherland–Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only vertices from the subject polygon tha

Vatti clipping algorithm

The Vatti clipping algorithm is used in computer graphics. It allows clipping of any number of arbitrarily shaped subject polygons by any number of arbitrarily shaped clip polygons. Unlike the Sutherl

© 2023 Useful Links.