Cohen sutherland line clippings algorithm, Computer Graphics

Cohen Sutherland Line Clippings Algorithm

The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as L, Right as R and assignment of number 1 and 0 to respective segments assists in positioning the area surrounding the window. How this positioning of areas is performed can be well determined by understood in following figure.

2465_Cohen Sutherland Line Clippings Algorithm.png

Figure: Positioning of regions surrounding the window

In figure as given above we have noticed that each coding of areas U, D, L and R is done along w.i.t. window region. Since window is neither Left nor Right, neither up nor down so, the respective bits UDLR are 0000; currently see area1 of above figure. The positioning code UDLR is 1010, that is the area1 lying on the position that is upper left side of the window. Hence, area1 has UDLR code 1010 i.e. Up so U=1, not Down so D=0, Left so L=1, not Right so R=0.

The sense of the UDLR code to identify the location of region w.i.t. window is:

1st bit ⇒ Up(U) ; 2nd bit ⇒ Down(D) ;3rd bit ⇒ Left(L) ;  4th bit ⇒ Right(R),

Currently, to perform Line clipping for different line segment that may reside within the window region partially or fully, or may not even lie in the widow area; we utilize the tool of logical ANDing among the UDLR codes of the points lying on the line.

Logical ANDing (^) operation

=>

1 ^ 1 = 1; 1 ^ 0 = 0;

between respective bits implies

 

Note:

 

0 ^ 1 = 0; 0 ^ 0 = 0

 

  • UDLR code of window is 0000 all the time and with respect to this will generate bit codes of other areas.
  • A line segment is observable if both the UDLR codes of the end points of the line segment equal to 0000 that is UDLR code of window area. If the resulting code is not 0000 then, which line segment or section of line segment may or may not be observable
Posted Date: 4/3/2013 2:54:25 AM | Location : United States







Related Discussions:- Cohen sutherland line clippings algorithm, Assignment Help, Ask Question on Cohen sutherland line clippings algorithm, Get Answer, Expert's Help, Cohen sutherland line clippings algorithm Discussions

Write discussion on Cohen sutherland line clippings algorithm
Your posts are moderated
Related Questions
determine the tranformation matrix for reflection,computer graphics

mcqs of illustration in nts test

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

What Is Computer Graphics? The term Graphics mean is Graphical Tricks. All image or picture is actually a graph and when various mathematical tricks are utilized to manipulate

Problem: (a) Distinguish between mono and stereo sound? (b) Calculate the size of a 5 minutes mono sound file of CD quality and with a 16 -bit rate. (c) With reference

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

Vector Graphics: These are images which may be entirely described by using mathematical definitions. The image below demonstrates the principle. To the left you notice the image i

Draw the five regular polyhedras using physics-based modeling method. Implement a fractal algorithm with possible personal extensions. Also, specify the extensions.

What is Aspect ratio?  The ratio of vertical points to the horizontal points essential to produce length of lines in both directions of the screen is known as the Aspect ratio.

What is persistence? The time it takes the emitted light from the screen to decompose one tenth of its original intensity is known as persistence.