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
Frame Buffers - Graphics Hardware The storage region in a raster scan display system is set as a two-dimensional table. All row-column entry stores information as brightness

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

what is region filling? give details

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

Associative Links: it is a link that is completely independent of the exact structure of the information. For illustration we have links depends on the meaning of various informat

Visible-Surface Detection For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we

2D Line Segment Generation  A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on

Tablet Computer - CAD and CAM Tablet Computer: it is a complete computer comprises in a touch screen. Tablet computers can be specialized for only Internet utilize or be fu

1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati