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
Question: (a) In computer graphics it is important to distinguish between the two approaches to graphical modeling:vector graphics and raster graphics. Explain in details th

Given arbitrary 8 values at the vertices of a cube, please draw the curved iso-surfaces with shading. Also, please draw the saddle point. This can be done relatively easy with phys

DV Encoder Type 1 : The video and audio streams are together interfaces by standard DV bit stream. Such format is fully supported through DirectShow which accepts this interleaved

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

Q: For the following polygon, prepare an initial sorted edge list and then make the active edge list for scan lines y = 5,20,30,35 Coordinates of the vertices are as shown in Figur

Softwares and Hardwares for Computer Animation The categories of both software as well as hardware needed to work on animation are now to be discussed. Computer animation can b

Photo and Video were determined in the 19th century: In books Visuals as add on to texts. They enabled distance education. They developed learning where verbal description was n

Write a C-code which generates a font interactively.This means after every n mouse clicks, a Bezier curve is generated and then the terminal point of the last drawn Bezier curve is

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme