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

Differences, difference between vecgen and breshnam algorithm

difference between vecgen and breshnam algorithm

Filled-area primitives - output primitives, Filled-Area Primitives  Fil...

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

Two-dimensional geometric transformations, Two-Dimensional Geometric Transf...

Two-Dimensional Geometric Transformations  When a real life object is modelled using shape primitives, there are several possible applications.  You may be required to do furth

Registers, explain the registers used in video controller

explain the registers used in video controller

Character generation, Which is the most usable and frequent method to gener...

Which is the most usable and frequent method to generate a character?

What is resolution, What is resolution? Ans. The maximum number of poin...

What is resolution? Ans. The maximum number of points that can be shown without an overlap on a CRT is known as resolution.

What is orthographic oblique projection, What is orthographic oblique proje...

What is orthographic oblique projection?  When the direction of the projection is not normal (not perpendicular) to the view plane then the projection is called as oblique proj

Point clipping - 2-d viewing and clipping, Point clipping - 2-d viewing and...

Point clipping - 2-d viewing and clipping Point clipping is the method related to suitable display of points in the scene, though this type of clipping is utilized less freque

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