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
Combination of Positive and Negative Accelerations Actually, it is not that a body once decelerated or accelerated will remain so, although the motion may include both speed-up

Explain Various techniques of Character Generation Algorithm?

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

Acquire a transformation matrix for perspective projection for a specified object projected onto x=3 plane as viewed by (5,0,0). Solution: Plane of projection: x = 3 as given.

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

applications of visualization

Define Octrees?  Hierarchical tree structures called octrees, are used to show solid objects in some graphics systems. Medical imaging and other applications that needs display

Radiosity - Polygon Rendering & Ray Tracing Methods Radiosity simulates the diffuse propagation of light begin at the light sources. Because global illumination is an extremel

Draw and explain the diagram of a Raster scan system with a display processor. Explain each unit of the diagram.

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