Other Line Clipping Algorithms
In addition to Cohen-Sutherland, there are:
Cyrus-Beck parametric algorithm
- used for non-trivial cases of Cohen-Sutherland
- find parameter value of each edge intersection
- classify entering or leaving
- simple comparison of largest entering vs. smallest leaving
- Liang-Barsky is more efficient version for upright rectangles
- readily generalizes to 3D
Nicholl-Lee-Nicholl
- immensely clever, but 2D upright rectangles only
- based on comparison with cut lines