Cyrus–Beck algorithm
lastmod 2018-08-17created 2015-10-234 edits
The Cyrus–Beck algorithm is a generalized line clipping algorithm. It was designed to be more efficient than the Sutherland–Cohen algorithm which uses repetitive clipping. Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window unlike Sutherland-Cohen that can be used only on a rectangular clipping area.
See also
Favorite site
- Wikipedia (en) description of Cyrus–Beck algorithm
- Viewing & Clipping - Cyrus-Beck Line Clipping Algorithm 1
References
-
Viewing_and_clipping.pdf ↩