Cyrus–Beck algorithm

CYRUS BECK ALGORITHM is It is a line clipping algorithm .It was designed to be more efficient than Sutherland-Cohen algorithm which uses repetitive clipping on a rectangular clipping area while cyrus beck is a general algorithm and can be used even with convex polygon clipping window

Here the parametric equation of a line in the view plane is: P(t)=P(0)+t(P₁-P₀) where t=0 at P1 t=o at t0 Now to find intersection point with the c;ipping window we calculate value of dot product n(Pt-f) {if >0 vector pointed toward interior

           if =0 vector pointed parallel to plane containing f
          if <0 vector pointed away from interior

By this we select the point of intersection of line and clipping window where ( =0 ) and hence clip the line

External links

http://cs1.bradley.edu/public/jcm/cs535CyrusBeck.html

• example.com