Trivial rejection case of cohen sutherland line clippings, Computer Graphics

Trivial Rejection Case of cohen sutherland line clippings

Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of the line segment is ≠ 0000 then line segment is not observable or is rejected.

Notice that, in figure of various cases of Cohen Sutherland Line Clippings, line 2 is totally on the top of the window but line 3 is neither on top nor at the in bottom plus, either on the left hand side nor on the right hand side of the window. We utilize the standard formula of logical ANDing to test the non visibility of the line segment.

675_Trivial Rejection Case of cohen sutherland line clippings.png

Figure: Cohen Sutherland line clipping

 Consequently, to test the visibility of line 2 and 3 we require calculating the logical intersection of end points for line 2 and lining 3.

Line l2: bit code of end points are 1010 and 1000 logical intersection of end points = (1010) ^ (1000) = 1000 like logical intersection ≠ 0000. Hence line 2 will be invisible.

Line l3: end points have bit codes 0010 and 0101 here logical intersection = 0000, that is, 0010 ^ 0101 = 0000 from the Figure of various cases of Cohen Sutherland Line Clippings, the line is invisible. Likewise in line 4 one end point is on top and another on the bottom therefore, logical intersection is 0000 although then it is partially visible, similar is true along with line 5. Such are exact cases and we will illustrate them in case 3.

Posted Date: 4/3/2013 2:59:46 AM | Location : United States







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

Write discussion on Trivial rejection case of cohen sutherland line clippings
Your posts are moderated
Related Questions
Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

Behavioral Animation - Computer Animation It used for control the motion of several objects automatically. Objects or "actors" are specified rules about how they respond to th

composite transformation

1. If you perform a x-direction shear transformation and then a y-direction shear transformation, will the result be the same as the one which is obtained when it is simultaneous s

Bresenham Line Generation Algorithm This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integ

TIFF: It is Tagged Image file format which is used mainly for exchanging documents among various applications and computers. This was primarily designed to turn into the standa


Question 1: (a) How can you select and manipulate individual objects in a group? (b) How do you resize an object? Explain how you determine the point from which the object r

Line Drawing - Points and lines Line drawing is accomplished through computing the intermediate point coordinates along the line path between two given end points. Since, scre

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