Trivial rejection case of cohen sutherland line clippings, Computer Graphics

Assignment Help:

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.


Related Discussions:- Trivial rejection case of cohen sutherland line clippings

Classic applications of digital video, The table as given below demonstrate...

The table as given below demonstrates possible values of such parameters for classic applications of digital video. Application                  Frame rate                  Dime

Important point for transformation for isometric projection, Important Poin...

Important Points about the Transformation for isometric projection Note: We can also verify such Isometric transformation matrix through checking all the foreshortening fact

Define polygon, Define polygon?  A polygon is any closed continues sequ...

Define polygon?  A polygon is any closed continues sequence of line segments i.e., a polyline whose last node point is similar as that of its first node point. The line segment

Categories of orthographic projection, Categories of Orthographic Projectio...

Categories of Orthographic Projection Orthographic projection is additionally divided into Multi-view projection and axonometric projection, depending upon where the direction

Polygon surfaces - curves and surfaces, Polygon Surfaces - Curves and Surfa...

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i

Clipping and 3d primitives, Clipping and 3D Primitives This unit introd...

Clipping and 3D Primitives This unit introduces you to three important concepts of Computer Graphics. After that discusses the concept of clipping, which means removal of objec

Reflection, examples and equation of reflection

examples and equation of reflection

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Perform a x-direction shear transformation, 1. If you perform a x-direction...

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

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd