Non trivial case of cohen sutherland line clippings, Computer Graphics

Non Trivial Case of cohen sutherland line clippings

Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2 situation do not hold, i.e. the case for l3, l4 and l5 line segments) demonstrated above in Figure. For these non-trivial Cases the algorithm is processed, as given below.

Because, both the bit-codes for the end points P, Q of the line segment cannot be equivalent to 0000.  Assume that the beginning point of the line segment is P those bit-code is not equivalent to 0000. For illustration, for the line segment l5 we decide P to be the bit codes 1001. Here, scan the bit-code of P from the first bit to the 4th bit and determine the position of the bit at that the bit value 1 appears at the first time. For the line segment line 5 it appears at the extremely first position. If the bit value 1 happens at the first position then proceed to intersect the line segment along with the UP edge of the window and allocate the first bit value to its point of intersection like 0. Likewise, if the bit value 1 arises at the second position while scanning the bit values at the initial time then intersect the line segment PQ along with the Down edge of the window. This point of intersection might be labeled as P'. Obviously the line segment PP' is outside the window and hence rejected and the original line segment considered for dipping will be P'Q. The coordinates of P' and its keeping new bit values are calculated. Here, by taking P as P', again we have the new line segment PQ that will again be referred to Case 1 for clipping.

926_non-trivial Case of cohen sutherland line clippings.png

Figure: Line Clipping - Geometrically

Posted Date: 4/3/2013 3:02:36 AM | Location : United States

Related Discussions:- Non trivial case of cohen sutherland line clippings, Assignment Help, Ask Question on Non trivial case of cohen sutherland line clippings, Get Answer, Expert's Help, Non trivial case of cohen sutherland line clippings Discussions

Write discussion on Non trivial case of cohen sutherland line clippings
Your posts are moderated
Related Questions
Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Graphic Primitives In previous section, we have discussed refreshing display devices and its categories which are Raster and Random Scan display devices. We have also discusse

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

Example1: Translate a square ABCD along with the coordinates as: A(0,0),B(5,0),C(5,5),D(0,5) via 2 units in x-direction and 3 units in y-direction. Solution: We can show the

Problem: (a) List four components of ‘Multimedia'. (b) Write short notes on the following: (i) itunes (ii) ipods (c) Some Multimedia development teams can have an

Question: a) Datagram packet delivery and Virtual circuit packet delivery are two approaches to the delivery of packets by the network layer. Explain. b) What is the meaning

Ambient Reflection-Polygon Rendering & Ray Tracing Methods When we go for the examiner of light effects, so surroundings play a significant role and it is assumed as there

To find out average unit normal vector at each polygon vertex At each polygon vertex as demonstrated by point V in the figure above, the normal vector is acquired by averaging