Determine the steps uses in cohen sutherland line clipping, Computer Graphics

Steps uses in the Cohen Sutherland Line Clipping Algorithm are:

217_Determine the Steps uses in Cohen Sutherland Line Clipping.png

Figure: Steps for Cohen Sutherland Line Clipping

STEP 1:

Input:

 xL , xR , yT , yB , P1 ( x1 , y1 ), P2 ( x2 , y2 )

 Initialize i = 1

While i <= 2

if xi  < xL  then bit 1 of code -Pi = 1 else 0

 if xi > xR then bit 2 of code -Pi =1 else 0         

: The endpoint codes of the line are then set

 if  yi  < yB then bit 3 of code -Pi = 1 else 0

if  yi  > yT then bit 4 of code -Pi = 1 else 0

i = i +1

end while

 i = 1

STEP 2:

Initialize j = 1

While j <= 2

 if xj   < xL then Cj left = 1 else Cj left = 0

 if x j > x R   then C j right = 1 else C j right   = 0

 : Set flags as per to the position of the line endpoints with respect to window

if  yj  < yB   then Cj bottom  = 1 else Cj bottom  = 0 edges

if  y j  > yT then Cj top = 1 else C jtop  = 0

 end while

STEP 3: If codes of P1and P2 are both equivalent to zero then draw P1P2 are wholly visible

STEP 4: If logical intersection or AND operation of code -P1 and code -P2 is not equivalent to zero then avoid P1P2 are wholly invisible

STEP 5: If code -P1= 0 then swap P1 and P2 with their flags and also set i = 1

STEP 6: If code -P1 < > 0 then

for i = 1,

{if C1 left = 1 then

find intersection ( xL , y'L )

assign code to ( xL , y'L )

P1 = ( xL , y'L )

end if

i = i + 1;

go to 3

}

with left edge vide eqn. (C)

 for i = 2,

{if C1 right = 1 then

find intersection ( xR , y'R ) with right edge vide eqn. (D)

assign code to ( xR , y'R )

P1 = ( xR , y'R )

end if

i = i + 1 go to 3

}

for i = 3

{if C1 bottom = 1 then

find intersection ( x 'B , yB ) with bottom edge vide eqn. (B)

assign code to ( x 'B , yB )

P1 = ( x 'B , yB )

end if

i = i + 1 go to 3

}

for i = 4,

{if C1 top = 1 then

find intersection ( x 'T , yT ) vide eqn. (A) with top edge assign code to ( x 'T , yT )

P1 = ( x 'T , yT )

end if

i = i + 1 go to 3

}

end

 

Posted Date: 4/3/2013 3:05:36 AM | Location : United States







Related Discussions:- Determine the steps uses in cohen sutherland line clipping, Assignment Help, Ask Question on Determine the steps uses in cohen sutherland line clipping, Get Answer, Expert's Help, Determine the steps uses in cohen sutherland line clipping Discussions

Write discussion on Determine the steps uses in cohen sutherland line clipping
Your posts are moderated
Related Questions

Object Space - approaches for visible surface determination The second approach as object-space that compares all objects directly along with each other inside the scene defin

Question 1 Explain Bresenham's Circle Drawing Algorithm Question 2 Derive the matrix for inverse transformation Question 3 Discuss the following Raster Graphic Algorithm

Draw a long line segment using (i) DDA line drawing algorithm (ii) Bresenham line drawing algorithm (iii) OpenGL function using GL_LINES.  Observe if DDA line segment deflects from

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

QUESTION A trainee designer, Susan, joins your place of work. During a workshop, you are asked to present on printing procedures and agencies in Mauritius. Susan asks you what

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Define pixel and frame buffer? Pixel is shortened forms of picture element. Every screen point is referred to as pixel or pel.  Picture definition is kept in a memory area c

Relation between 2-D Euclidean system and Homogeneous coordinate system Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the poin

Sprite animation interactive, may be non rectangular (Computer games) In its simplest form it is a 2-D graphic object which moves across the display. Sprites frequently can hav