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
Illustration: Find the normalization transformation N that uses the rectangle W (1, 1), X (5, 3), Y (4, 5) and Z (0, 3) as a window and also the normalized device screen like the

What do you mean by parabolic splines?  For parabolic splines a parabola is fitted by the first three points p1, p2,p3 of the data array of kot points. Then a second parabolic

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping

(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered

You will write a two-dimensional precursor of the three-dimensional bouncing ball simulation that is one of your choices for a ?nal project. This involves adding functions to your

Graphics Hardware - Computer aided Design Despite with which advance graphic software you are working along with, if your output device is not well or hardware handling which

Explain the 3d transformations

Discuss in detail about rendering Computer animation uses a technique termed as avars (animation variable) where starting point is generally a series of stick figures; for exam

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

Types of Bitmap Images Bitmap images can include any number of colours but we distinguish among four main categories as: 1)      Line-art: These are images that include