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
What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal

Non Trivial Case of cohen sutherland line clippings Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2

Remember in polygonalization of the surface, following rules must be followed. Any two polygons  (i)  share a common edge,   (ii)  Share a common vertext,  (iii)  Arc disj

Explain process of displaying objects in raster display and random display. Draw block diagrams of the architecture of both the display systems.



Procedural Animation - Computer Animation This category of animation is utilized to produce real time animation that permits a more diverse series of actions to occur. These a

Write a C-code which generates a font interactively.This means after every n mouse clicks, a Bezier curve is generated and then the terminal point of the last drawn Bezier curve is

Obtain an MRI image using the Open Source internet resources. i. Read the image into Scilab ii. Plot the image iii. Covert it into grayscale image and plot it iv. Find/

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.