Viewing & Clipping In 2D

BY:AKANKSHA YADAV
FOET,LU
SUBJECT:COMPUTER GRAPHICS
BRANCH/YEAR:MCA/2ND.
 2
of
44
Contents
Windowing Concepts
Clipping
– Introduction
– Brute Force
– Cohen-Sutherland Clipping Algorithm
Area Clipping
– Sutherland-Hodgman Area Clipping
Algorithm
 3
of
44
Windowing I
A scene is made up of a collection of objects
specified in world coordinates

World Coordinates
 4
of
44
Windowing II
When we display a scene only those objects
within a particular window are displayed
Window
wymax

wymin

wxmin wxmax
World Coordinates
 5
of
44
Windowing III
Because drawing things to a display takes
time we clip everything outside the window
Window
wymax

wymin

wxmin wxmax
World Coordinates
 6
of
44

Explain the terms “Window” and “Viewport”. Write the

general form of window to viewport coordinate
transformation equation.
A world-coordinate area selected for display is called a
window.
An area on a display device to which a window is
mapped is called a viewport.
The window defines what is to be viewed, the viewport
defines where it is to be displayed.
In computer graphics terminology, the term window
originally referred to an area of a picture that is selected for
viewing.
 7
of
44

WINDOW-TO-VIEWPORT COORDINATE TRANSFORMATION

Figure illustrates the window-to-viewport mapping.

A point at position (xw,yw) in the window is mapped into position
(xv,yv) in the associated viewport. To maintain the same relative
placement in the viewport as in the window, we require that
 8
of
44
 9
of
44
10
of
44

The conversion from window area to

viewport area is performed with the following
sequence of transformation.
1. Perform a scaling transformation using a
fixed point position of (xwmin,ywmin) that
scales the window area to the size of the
viewport.
2. Translate the scaled window area to the
position of the viewport.
11
of
44
Clipping
Any procedure that identifies those portions
of a picture that are either inside or outside
of a specified region of a space is referred to
as a clipping algorithm or simply clipping.

The region against which an object is to

clipped is called a clip window.
12
of
44
Clipping
For the image below consider which lines
and points should be kept and which ones
should be clipped
P4

Window P2
wymax
P6
P3
P1
P7 P5

P9
P8
wymin
P10

wxmin wxmax
13
of
44
Point Clipping
Easy - a point (x,y) is not clipped if:
wxmin ≤ x ≤ wxmax AND wymin ≤ y ≤ wymax
otherwise it is clipped
P4 Clipped
Clipped

Window P2
wymax
Clipped
P5
P1
P7 Points Within the Window
are Not Clipped
P9 P8
wymin
Clipped P10

wxmin wxmax
14
of
44
Line Clipping
Harder - examine the end-points of each line
to see if they are in the window or not
Situation Solution Example

Both end-points inside

Don’t clip
the window

One end-point inside

the window, one Must clip
outside

Both end-points
Don’t know!
outside the window
15
of
44
Brute Force Line Clipping
Brute force line clipping can be performed as
follows:
– Don’t clip lines with both
end-points within the
window
– For lines with one end-
point inside the window
and one end-point
outside, calculate the
intersection point (using the equation of the
line) and clip from this point out
16
of
44
Brute Force Line Clipping (cont…)
– For lines with both end-
points outside the
window test the line for
intersection with all of
the window boundaries,
and clip appropriately

However, calculating line intersections is

computationally expensive
Because a scene can contain so many lines,
the brute force approach to clipping is much
too slow
17
of
44
Cohen-Sutherland Clipping Algorithm

An efficient line clipping

algorithm
The key advantage of the
algorithm is that it vastly
reduces the number of line
intersections that must be Dr. Ivan E. Sutherland
co-developed the Cohen-
calculated Sutherland clipping
algorithm. Sutherland is
a graphics giant and
includes amongst his
Cohen is something of a mystery – can achievements the
anybod y find out who he was? invention of the head
m o u n t e d d i s p l a y.
18
of
44
Cohen-Sutherland Clipping Algorithm

• One of the earliest algorithms with many

variations in use.
• Processing time reduced by performing
more test before proceeding to the
intersection calculation.
•Initially, every line endpoint is assigned a
four digit binary value called a region code,
and each bit is used to indicate whether the
point is inside or outside one of the clipping-
window boundaries.
19
of
44
Cohen-Sutherland Clipping Algorithm

• We can reference the window edges in any

order, and here is one possibility.
4 3 2 1
Top Bottom Right Left

•For this ordering, (bit 1) references the left

boundary, and (bit 4) references the top one.
•A value of 1 (true) in any bit position
indicate that the endpoint is outsides of that
border.
•A value of 0 (false) indicates that the
endpoint is inside or on that border.
20
of
44
Cohen-Sutherland: World Division
•The four window borders create nine
regions
•The Figure below lists the value for the
binary code in each of these regions.
Thus, an endpoint that is
1001 1000 1010
below and to the left of the
clipping window is assigned 0000
the region (0101). 0001 0010
Window
The region code for any
endpoint inside the clipping 0101 0100 0110
window is (0000).
21
of
44
Cohen-Sutherland: Labelling
Every end-point is labelled with the
appropriate region code
P11 [1010]
P4 [1000]

Window
wymax
P6 [0000]
P3 [0001]
P5 [0000] P12 [0010]
P7 [0001]
P9 [0000] P8 [0010]
wymin
P10 [0100]
P13 [0101] P14 [0110]

wxmin wxmax
22
of
44
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
P11 [1010]
P4 [1000]

Window
wymax
P6 [0000]
P3 [0001]
P5 [0000] P12 [0010]
P7 [0001]
P9 [0000] P8 [0010]
wymin
P10 [0100]
P13 [0101] P14 [0110]

wxmin wxmax
23
of
Cohen-Sutherland: Lines Outside The
44 Window
Any lines with 1 in the same bit position for both end-points
is completely outside and must be clipped.
For example a line with 1010 code for one endpoint and
0010 for the other (line P11, P12) is completely to the right
of the clipping window.
P11 [1010]
P4 [1000]

Window
wymax
P6 [0000]
P3 [0001]
P5 [0000] P12 [0010]
P7 [0001]
P9 [0000] P8 [0010]
wymin
P10 [0100]
P13 [0101] P14 [0110]

wxmin wxmax
24
of
44
Cohen-Sutherland: Inside/Outside Lines

•We can perform inside/outside test for lines

using logical operators.
•When the or operation between two
endpoint codes is false (0000), the line is
inside the clipping window, and we save it.
•When the and operation between two
endpoint codes is true (not 0000), the line is
completely outside the clipping window, and
we can eliminate it.
25
of
44
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
26
of
44
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
27
of
44
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 doesn’t P [0000]
9
wymin
cross the left or right P ’ [0000]
10

boundary P [0100]
10

– 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
28
of
44
Cohen-Sutherland Examples (cont…)

Consider the line P3 to P4 below

– Start at P4 P ’ [1001]
P [1000]
4
4
Window
– From the region codes max wy

of the two end-points P [0001]

3

we know the line

crosses the left wymin
boundary so calculate
the intersection point to
generate P4’ wxmin wxmax

– The line P3 to P4’ is completely outside the

window so is clipped
29
of
44
Cohen-Sutherland Examples (cont…)

Consider the line P7 to P8 below

– Start at P7
– From the two region wymax
Window

codes of the two

end-points we know P7 [0001]
P7’ [0000]
P8 [0010]
the line crosses the P8’ [0000]
wymin
left boundary so
calculate the
intersection point to wxmin wxmax
generate P7’
30
of
44
Cohen-Sutherland Examples (cont…)

Consider the line P7’ to P8

– Start at P8
– Calculate the wymax
Window

intersection with the

right boundary to P7’ [0000]
P8 [0010]
P7 [0001]
generate P8’ P8’ [0000]
wymin
– P7’ to P8’ is inside
the window so is
retained wxmin wxmax
31
of
44
Cohen-Sutherland Examples (cont…)

Q.1: Explain Sutherland-Cohen algorithm

giving all possible cases of line clipping with
the help of diagram?
32
of
44
Cohen-Sutherland Examples (cont…)

Q.2: Explain Cohen-Sutherland algorithm

and list the clipping categories for the line
segments given in the following picture.
33
of
44
Cohen-Sutherland Examples (cont…)

Q.3: Let R be the rectangular window whose lower

left-hand corner is at L(-3, 1) and upper right-hand
corner is at R(2, 6). Find the endpoint codes for
the following lines using Sutherland-Cohen
algorithm and write the clipping category for line
AB, CD, EF, GH, IJ:
A(-4, 3) B(-1, 9)
C(-2, 5) D(4, 8)
E(-2, 3) F(1, 2)
G(-1, -2) H(3, 3)
I(-4, 7) J(-2, 10)
34
of
44
Cohen-Sutherland Examples (cont…)
35
of
44
Cohen-Sutherland Examples (cont…)

Category 1 (visible): EF since both endpoint

codes are 0000

Category 2 (not visible): IJ since (1001) AND

(1000)=1000 (which is not 0000)

Category 3 (candidates for clipping): AB, CD

and GH (since logic AND of line end points
equal 0000)
36
of
44
Calculating Line Intersections
Intersection points with the window
boundaries are calculated using the line-
equation 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
37
of
44
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)
38
of
44
Area Clipping

Similarly to lines, areas

must be clipped to a
window boundary
Consideration must be
taken as to which
portions of the area must
be clipped
39
of
44
Area Clipping
40
of
44
Area Clipping
41
of
44
Text Clipping
42
of
44
Text Clipping
43
of
44
Curve Clipping