Cyrus–Beck algorithm

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

• Cohen–Sutherland algorithm
• Sutherland–Hodgman algorithm

Favorite site

• Wikipedia (en) Cyrus–Beck algorithm에 대한 설명
• Viewing & Clipping - Cyrus-Beck Line Clipping Algorithm ¹

References