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
Functions Available in Animation Packages Some broad functions available in animation packages are as: Object Function to manage and store the object database , where

Area Filling Algorithms Before we go ahead with area filling algorithms, a word about pixel addressing and object geometry. You know that line segments are discretized into fin

Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection

Write short notes on active and passive transformations?  In the active transformation the points x and x represent different coordinates of the similar coordinate system. Here

Archeology: along with the advent of the computer, the archeologist has obtained a new tool, computer animation. An object-model can be made comparatively quick and without any we

Principle Vanishing point - Perspective Projections Assume that line 1 and l2 be two straight lines parallel to each other that are also parallel to x-axis. If the projection

Distinguish between parallel and perspective projection Parallel Projection Perspective projection Coordinate position are transformed

Education and training systems are making with three major objectives as: a) The learning objectives and purpose of the training. b)  Assessment or testing of the students to

Introduction of 2-D and 3-D  Transformations In this, the subsequent things have been discussed in detail as given below: Different geometric transformations as transla

Question 1 What is Packet-switching network? Discuss its basic operation Question 2 Briefly describe Jackson's theorem Question 3 List and explain the two popular