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
1. Design a bitmap for the English vowels A, E, I, O, U for two different sizes and then implement the bitmaps to plot these vowels on the display. Keep in mind that baseline of al

Mathematics: There are some area like Probability, combination, permutation, etc.,that can be well explained along with the help of animation, that helps in enhancing the learning

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

2-D Viewing and Clipping - Raster Graphics and  Clipping In the previous two units of this block, we illustrated the basic elements of computer graphics, that is, the hardware

diffrence between vecgen and bresenham'' s algorithams

Question 1 Explain any ten types of artistic filters Question 2 What is Freehand Tool? Explain the procedure of drawing lines and curves with freehand tool Question 3 Ho

Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection

File format We want an image of a Fly. The wings are incompletely transparent and to present that in our presentation what be problematic if suitable file format is not there.

Q.  Write a short note on area subdivision method for hidden surface removal.   Ans. Area Subdivision This technique for hidden- surface removal is essentially an image- spac

short note on shading