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.

Here the parametric equation of a line in the view plane is:

${\displaystyle {\begin{aligned}p(t)&=&tp_{1}+(1-t)p_{0}\\&=&p_{0}+t(p_{1}-p_{0})\end{aligned}}}$

where ${\displaystyle 0\leq t\leq 1}$.

...
Wikipedia