Non trivial case of cohen sutherland line clippings, Computer Graphics

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 situation do not hold, i.e. the case for l3, l4 and l5 line segments) demonstrated above in Figure. For these non-trivial Cases the algorithm is processed, as given below.

Because, both the bit-codes for the end points P, Q of the line segment cannot be equivalent to 0000.  Assume that the beginning point of the line segment is P those bit-code is not equivalent to 0000. For illustration, for the line segment l5 we decide P to be the bit codes 1001. Here, scan the bit-code of P from the first bit to the 4th bit and determine the position of the bit at that the bit value 1 appears at the first time. For the line segment line 5 it appears at the extremely first position. If the bit value 1 happens at the first position then proceed to intersect the line segment along with the UP edge of the window and allocate the first bit value to its point of intersection like 0. Likewise, if the bit value 1 arises at the second position while scanning the bit values at the initial time then intersect the line segment PQ along with the Down edge of the window. This point of intersection might be labeled as P'. Obviously the line segment PP' is outside the window and hence rejected and the original line segment considered for dipping will be P'Q. The coordinates of P' and its keeping new bit values are calculated. Here, by taking P as P', again we have the new line segment PQ that will again be referred to Case 1 for clipping.

926_non-trivial Case of cohen sutherland line clippings.png

Figure: Line Clipping - Geometrically

Posted Date: 4/3/2013 3:02:36 AM | Location : United States







Related Discussions:- Non trivial case of cohen sutherland line clippings, Assignment Help, Ask Question on Non trivial case of cohen sutherland line clippings, Get Answer, Expert's Help, Non trivial case of cohen sutherland line clippings Discussions

Write discussion on Non trivial case of cohen sutherland line clippings
Your posts are moderated
Related Questions
Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

Transformation for parallel projection Parallel projections is also termed as Orthographic projection, are projections into one of the coordinate planes as x = 0, y = 0 or z

Ellipse Generation Algorithm  You know that a circle is symmetric in all the octants, while ellipse is symmetric with respect to four quadrants.  Therefore, to draw an ellipse,

Write a simple C-code to generate a circular arc between two angle values. Use this to draw Figure.

Digital audio comprises audio signals stored in a digital format. Particularly, the term encompasses the subsequent: 1)   Audio conversion: 1.   Analogue to digital conversi

why there is coating of phosphorous on CRT screen?

Use of Interactive Multimedia in Education Virtual reality, where 3-D experimental training can simulate real situations. Computer simulations of things too expensive,

What is the advantages and disadvantages of reflection ?

What is riged body transformation matrix? Show that the composition lf two rotation is additive by concatenating the matrix representation of r (theta 2 ) = R (theta1 + theta 2 ) t

Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the