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
GIF File Compression The Graphic Interchange Format file format utilizes a relatively basic form of file compression which squeezes out inefficiencies within the data storage w

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Which is the most usable and frequent method to generate a character?

pagemaker is a image editor

explain the registers used in video controller

Write a polygon clipping algorithm to clip a polygon against rectangular clipping are. Read the vertices of polygon to be clipped. 2. Read the coordinates of the rectangular 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

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

Image Processing New digital technology has made this possible for the manipulation of multi- dimensional signals along with systems which range from easy digital circuits to

What is the use of control points?  Spline curve can be specified by giving a set of coordinate positions known as control points, which shows the general shape of the curve, c