Cohen sutherland line clippings algorithm, Computer Graphics

Assignment Help:

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

Related Discussions:- Cohen sutherland line clippings algorithm

Advantages of scan line algorithm, Advantages of Scan line Algorithm:  ...

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

Relation between polar coordinate and cartesian system, Relation between po...

Relation between polar coordinate system and Cartesian system A frequently utilized non-cartesian system is Polar coordinate system. The subsequent figure A demonstrates a pol

Write a c-code for a user to draw a polygon object, Write a C-code for an i...

Write a C-code for an interactive program which allows a user to draw a polygon object in a window and then gives various choices of geometric transformations on the polygon.  Once

Scan line polygon fill algorithm - raster graphics, Scan Line Polygon Fill ...

Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

Representational animation - computer animation, Representational Animation...

Representational Animation - Computer Animation This method permits an object to change its shape throughout the animation. There are three sub-types to this. The initial is th

Horizontal retrace - display devices, Horizontal retrace - Display Devices ...

Horizontal retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the left most point on the next horizontal line after refresh

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

Transformation for 3-d rotation, Transformation for 3-D Rotation Rotat...

Transformation for 3-D Rotation Rotation in 3-dimensions is considerably more complicated then rotation in 2-dimensions. In 2-Dimentional, a rotation is prescribed via an angl

Homogeneous coordinates, What are the uses of homogeneous coordinates? Conv...

What are the uses of homogeneous coordinates? Convert translation rotation and scaling in homogeneous coordinates. In mathematics homogeneous coordinates introduced by August

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd