Cyrus Beck Algorithm - Line Clipping Algorithm Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. The term parametric means that we require finding the value of the parameter t in the parametric representation of the line segment for the point at that the segment intersects the clipping edge. For good understanding, identify the Figure (a) as in above, here P Q is a line segment, that is intersecting at the two edges of the convex window. Note: The algorithm is appropriate to the "convex polygonal window". Figure: (a): Interaction of line PQ and Window Here, just again call the parametric equation of line segment PQ that we have already studied. This is simply    P + t (Q - P)      0 ≤ t ≤ 1 Here, t → linear parameter incessantly changes value. ∴P + t (Q - P) ⇒ (x1, y1) + t (x2 - x1, y2 - y1) = (x, y) be any point on PQ.    ------ (1) For such equation (1) we have subsequent cases: 1)   While t = 0 we obtain the point P. 2)   While t = 1 we get the point Q. 3)   While t varies then 0 ≤ t ≤ 1 then line in between point P and Q is traced.  For t = ½ we find the mid-point of PQ. 4)   While t < 0 line on Left hand side of P is traced. 5)   While t > 1 line on Right hand side of Q is traced. Consequently, the variation in parameter t   is actually generating line in point wise method. The range of the parameter values will discover the portion to be clipped through any of convex polygonal region consisting of n-vertices or lattice points to be identified through the user. There is one type of clipping situation is shown in Figure (a) of Interaction of line PQ and Window. Posted Date: 4/3/2013 3:17:29 AM | Location : United States

Ask an Expert

Your posts are moderated

Write your message here..

Related Questions

Cathode ray tube - graphics hardware, Cathode Ray Tube - Graphics Hardware ... Cathode Ray Tube - Graphics Hardware Cathode Ray Tube: this is a refreshing display device. The idea of a refreshing display is depicted pictorially is given as: In fact

DDA, limitationsof dda limitationsof dda

What do you mean by scan conversion, What do you mean by scan conversion?  ... What do you mean by scan conversion?  A main task of the display processor is digitizing a picture definition given in an application program into a set of pixel-intensity valu

Important points about the surface of revolution, Important points about th... Important points about the Surface of Revolution a) if a point on base curve is given by parametric form, that are: (x(u), y(u), z(u)) so surface of revolution regarding to th

Rotation - 2-d and 3-d transformations, Rotation - 2-d and 3-d transformati... Rotation - 2-d and 3-d transformations Given a 2-D point P(x,y), that we want to rotate, along with respect to an arbitrary point A(h,k). Suppose P'(x'y') be the effect of ant

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl... Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

Categories of reflection - ray tracing methods , Categories of Reflection -... Categories of Reflection - Ray Tracing Methods In order to achieve realism, such phenomenon of reflection, which occurs because of interaction of light and surface, is require

Designing human Computer interface, I have an assignment to do & it''s due ... I have an assignment to do & it''s due on Wednesday !

What is scaling, What is scaling?  The scaling transformations changes... What is scaling?  The scaling transformations changes the shape of an object and can be carried out by multiplying every vertex (x,y) by scaling factor Sx, Sy where Sx is the

Applications for computer animation, Applications For Computer Animation ... Applications For Computer Animation These days, animation influences approximately every aspect of life right from entertainment to education and to security and lots of more a