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
Program of PERT in c language

Lossy Audio Formats: These are based on sound models which eliminate audio data such humans cannot or can hardly hear, for example: a low volume sound after a large volume sound.

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

Principal vanishing point write respect to y-axis By the 2nd Row of the matrix as in Equation, the principal vanishing point w.r.t y-axis will as: (0, 5/√2, 0, 1/√2) in hom

3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Important Points for Windowing Transformations 1. Window explains what is to be viewed and viewpoint describes where it is to be displayed. 2. Frequently window and viewpoi

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

Question: (a) Describe in details the meaning of the following terms often available in drawing tools: (i) Welding objects; (ii) Trimming objects; (iii) Intersecting obje

1. Using a time Delay Method The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is

Polygon Representation Methods - Modeling and Rendering Any scene to be created by computer graphics may include a variety of objects, a few of them natural and manmade. Hence