Cyrus–Beck algorithm
The Cyrus–Beck algorithm is a generalized line clipping algorithm. It was designed to be more efficient than the Cohen–Sutherland algorithm, which uses repetitive clipping. Cyrus–Beck is a general algorithm and can be used with a convex polygon clipping window, unlike Sutherland–Cohen, which can be used only on a rectangular clipping area.
Here the parametric equation of a line in the view plane is
where.
Now to find the intersection point with the clipping window, we calculate the value of the dot product. Let pE be a point on the clipping plane E.
Calculate :
Here n stands for normal of the current clipping plane.
By this we select the point of intersection of line and clipping window where and hence clip the line.
