Scribd
Upload
657 views

Cohen Sutherland Algorithm

The Cohen-Sutherland algorithm clips lines against the boundaries of a viewing window by assigning region codes to line endpoints based on their position relative to the window boundaries. It can trivially accept or reject lines that are fully inside or outside the window. For lines partially in/out, it iteratively clips against one boundary at a time by calculating intersection points, until the remaining line segment is fully in or out of the window. Region codes identify which boundary to check at each step in a efficient manner.

Uploaded by

shubhangi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
657 views

Cohen Sutherland Algorithm

The Cohen-Sutherland algorithm clips lines against the boundaries of a viewing window by assigning region codes to line endpoints based on their position relative to the window boundaries. It can trivially accept or reject lines that are fully inside or outside the window. For lines partially in/out, it iteratively clips against one boundary at a time by calculating intersection points, until the remaining line segment is fully in or out of the window. Region codes identify which boundary to check at each step in a efficient manner.

Uploaded by

shubhangi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

Cohen-Sutherland Algorithm

Shubhangi Shinde

Clipping
Why clipping?
Not everything defined in the world coordinates is inside the world window

Where does clipping take place?


Model Clipping Viewport Transformation

Line Clipping
Visible : Both end points of the line segment lie within the window. Non-visible: When line definitely lies outside the window. This will occur if line segment satisfy
X1,x2,>xmax y1,y2 >ymax X1,x2<xmin y1,y2<ymin

Partially visible: A line is partially visible when a part of its lies within the window.

Cohen-Sutherland: World Division


World space is divided into regions based on the window boundaries
Each region has a unique four bit region code Region codes indicate the position of the regions with respect to the window 1001
3 2 1 0 left above below right Region Code Legend

1000 0000
Window

1010 0010 0110

0001 0101

0100

Cohen-Sutherland Line Clipping Algorithm


Trivial accept and trivial reject
If both endpoints within window trivial accept If both endpoints outside of same boundary of window trivial reject

Otherwise
Clip against each edge in turn Throw away clipped off part of line each time

How can we do it efficiently (elegantly)?


5

Cohen-Sutherland Line Clipping Algorithm


Examples:
trivial accept? trivial reject?
window L4

L2
L3 L1 L5

L6

Cohen-Sutherland Line Clipping Algorithm


Use region outcode

1st Bit : Point lies to left of window x<xmin 2nd bit : point lies to right of window x>xmax 3rd bit : point lies below of window y<ymin 4th bit : piont lies above window y>ymax.

outcode[1] (x < Window.left) outcode[2] (y > Window.top) outcode[3] (x > Window.right) outcode[4] (y < Window.bottom)

Cohen-Sutherland Line Clipping Algorithm

Cohen-Sutherland Line Clipping Algorithm


Both outcodes are FFFF
Trivial accept

Logical AND of two outcodes FFFF


Trivial reject

Logical AND of two outcodes = FFFF


Cant tell Clip against each edge in turn Throw away clipped off part of line each time
10

Cohen-Sutherland Line Clipping Algorithm


Examples:
outcodes? trivial accept? trivial reject?
L1 L5 window L4

L2
L3

L6

11

Cohen-Sutherland: Labelling
Every end-point is labelled with the appropriate region code
P4 [1000] P11 [1010]

wymax
P3 [0001]

Window
P6 [0000] P5 [0000] P7 [0001] P9 [0000] P12 [0010] P8 [0010] P10 [0100]

wymin
P13 [0101]

P14 [0110]

wxmin

wxmax

Cohen-Sutherland: Lines In The Window


Lines completely contained within the window boundaries have region code [0000] for both end-points so are not clipped
P4 [1000] P11 [1010]

wymax
P3 [0001]

Window
P6 [0000] P5 [0000] P7 [0001] P9 [0000] P12 [0010] P8 [0010] P10 [0100]

wymin
P13 [0101]

P14 [0110]

wxmin

wxmax

Cohen-Sutherland: Lines Outside The Window Any lines with a common set bit in the region codes of both end-points can be clipped
The AND operation can efficiently check this
P4 [1000] P11 [1010]

wymax
P3 [0001]

Window
P6 [0000] P5 [0000] P7 [0001] P9 [0000] P12 [0010] P8 [0010] P10 [0100]

wymin
P13 [0101]

P14 [0110]

wxmin

wxmax

Cohen-Sutherland: Other Lines


Lines that cannot be identified as completely inside or outside the window may or may not cross the window interior These lines are processed as follows:
Compare an end-point outside the window to a boundary (choose any order in which to consider boundaries e.g. left, right, bottom, top) and determine how much can be discarded If the remainder of the line is entirely inside or outside the window, retain it or clip it respectively

Cohen-Sutherland: Other Lines (cont)


Otherwise, compare the remainder of the line against the other window boundaries Continue until the line is either discarded or a segment inside the window is found

We can use the region codes to determine which window boundaries should be considered for intersection
To check if a line crosses a particular boundary we compare the appropriate bits in the region codes of its end-points If one of these is a 1 and the other is a 0 then the line crosses the boundary

Cohen-Sutherland Examples
Consider the line P9 to P10 below
Start at P10 Window wymax From the region codes of the two end-points we know the line doesnt P [0000] cross the left or right wymin P [0000] boundary P [0100] Calculate the wxmin wxmax intersection of the line with the bottom boundary to generate point P10 The line P9 to P10 is completely inside the window so is retained
9 10 10

Cohen-Sutherland Examples (cont)


Consider the line P3 to P4 below
P [1000] Start at P4 P [1001] Window wy max From the region codes P [0001] of the two end-points we know the line crosses the left wymin boundary so calculate the intersection point to generate P4 wxmax min The line P3 to P4 is completely outsidewx the window so is clipped
4 4 3

Cohen-Sutherland Examples (cont)


Consider the line P7 to P8 below
Start at P7 From the two region codes of the two end-points we know the line crosses the left boundary so calculate the intersection point to generate P7
wymax Window

P7 [0000] P7 [0001] P8 [0010] P8 [0000]

wymin

wxmin

wxmax

Cohen-Sutherland Examples (cont)


Consider the line P7 to P8
Start at P8 Calculate the intersection with the right boundary to generate P8 P7 to P8 is inside the window so is retained
wymax

Window

P7 [0000] P7 [0001] P8 [0010] P8 [0000]

wymin

wxmin

wxmax

Cohen-Sutherland Worked Example


Window
wymax

wymin

wxmin

wxmax

Calculating Line Intersections


Intersection points with the window boundaries are calculated using the lineequation parameters
Consider a line with the end-points (x1, y1) and (x2, y2) The y-coordinate of an intersection with a vertical window boundary can be calculated using: y = y1 + m (xboundary - x1) where xboundary can be set to either wxmin or wxmax

Calculating Line Intersections (cont)


The x-coordinate of an intersection with a horizontal window boundary can be calculated using: x = x1 + (yboundary - y1) / m where yboundary can be set to either wymin or wymax m is the slope of the line in question and can be calculated as m = (y2 - y1) / (x2 - x1)

You might also like