Cyrus beck algorithm - line clipping algorithm, Computer Graphics

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".

2303_Cyrus Beck Algorithm - Line Clipping Algorithm.png

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







Related Discussions:- Cyrus beck algorithm - line clipping algorithm, Assignment Help, Ask Question on Cyrus beck algorithm - line clipping algorithm, Get Answer, Expert's Help, Cyrus beck algorithm - line clipping algorithm Discussions

Write discussion on Cyrus beck algorithm - line clipping algorithm
Your posts are moderated
Related Questions
Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar

Refresh Rate: refreshing on raster - scan displays is carried out at the rate of 60 to 80 frames per second, although some system are designed for higher refresh rates. Sometimes,

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

Bitmap Graphics: The information below illustrates bitmap data. Bitmap images are a set of bits that form an image. The image comprises a matrix of individual dots or pixels wh

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

QUESTION a) Once a print job is accepted by the print service provider, it will be assigned a job number and this information will become part of a printed job ticket, which wi


Draw the five regular polyhedras using physics-based modeling method. Implement a fractal algorithm with possible personal extensions. Also, specify the extensions.

Bezier Curves - Modeling and Rendering Bezier curves are utilized in computer graphics to turn out curves which display reasonably smooth at all scales. Such spline approximat

Vertical retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the top, left most point on the monitor after refreshing all ho