Scribd
Upload
14 views16 pages

Polygon Clipping

The document discusses polygon clipping, explaining what polygons are and their types, including concave and convex polygons. It details two algorithms for polygon clipping: the Sutherland-Hodgeman algorithm, which handles different clipping cases, and the Weiler-Atherton algorithm, which is capable of clipping filled areas, including concave polygons. The document also outlines the conditions for clipping and provides examples of how each algorithm operates.

Uploaded by

Komal Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views16 pages

Polygon Clipping

The document discusses polygon clipping, explaining what polygons are and their types, including concave and convex polygons. It details two algorithms for polygon clipping: the Sutherland-Hodgeman algorithm, which handles different clipping cases, and the Weiler-Atherton algorithm, which is capable of clipping filled areas, including concave polygons. The document also outlines the conditions for clipping and provides examples of how each algorithm operates.

Uploaded by

Komal Garg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

DELHI TECHNOLOGICAL UNIVERSITY

Computer Graphics
POLYGON CLIPPING

Prepared By-
Vivek Kumar (2K19/CO/436)
Sahil Yadav (2K19/IT/114)
POLYGON-
“A Polygon can be described as the enclosed collection or group of the lines.”

In a polygon, all lines are connected. Lines can be a combination of edges and
vertices, which together form a polygon. A polygon refers to a two-dimensional
architecture made up of a number of straight lines.

Some Examples of the polygon:


1. Triangles
2. Pentagons
3. Hexagons
4. Quadrilaterals
The polygon’s name defines how many sides the architecture contains.

Triangle: It has three sides. Quadrilaterals: It contains four


sides.

Pentagon: A pentagon has five sides . Hexagon: It contains six sides.


Types of Polygon

There are two basic types of polygon-

1. Concave Polygon
2. Convex Polygon

Convex Polygon: The convex polygon does not have any part of its diagonals in its
exterior. In a convex polygon, all the angles should be less than 180° (angle<180°).

Concave Polygon: The concave polygon has at least one part of diagonal in its
exterior. In a concave polygon, at least one angle should be greater than 180° (angle
>180°).
Polygon Clipping

Polygon clipping is a process in which we only consider the part which is inside the
view pane or window. We will remove or clip the part that is outside the window. We
will use the following algorithms for polygon clipping–

TWO ALGO' :
• Sutherland-Hodgeman polygon clipping algorithm

• Weiler-Atherton polygon clipping algorithm


Sutherland-Hodgeman polygon clipping algorithm
The polygon clipping algorithm deals with four different clipping cases. The output
of each case is input for the next case.

Case1) Left clip: In the left side polygon clipping, we only


remove the left part of the polygon, which is outside the
window. We only save the portion which is inside the
window.
Case2) Right clip: In the right-side polygon clipping, we
only remove the right part of the polygon, which is
outside the window. We only save the portion which is
inside the window.

Case3) Top clip: On the top side polygon clipping, we


only remove the top part of the polygon, which is
outside the window. We only save the portion which is
inside the window.

Case4) Bottom clip: In the bottom side polygon


clipping, we only remove the bottom part of the
polygon, which is outside the window. We only
save the portion which is inside the window.
There should be the following conditions while we clip a polygon.

Condition 1(Out-In): If the first vertex of


the polygon is outside and the second
vertex is inside the window, then the output
will be the intersection point and second
vertex.

Condition 2(In-Out): If the first vertex of the


polygon is inside and the second vertex is
outside the window, then the output will be
the intersection point.
Condition 3(In-In): If both vertices of
the polygon are inside the window,
then the output will be the second
vertex.

Condition 4(Out-Out): If both vertices of the


polygon are outside the window, then the
output will be nothing. It means we found a
clipped polygon.
Example-
Weiler-Atherton polygon clipping
algorithm

This algorithm helps us to clip a filled area. The filled area may be a
convex polygon or concave polygon. This algorithm was introduced
to identify the visible surfaces. This algorithm helps to create
individual polygons in some cases. In the Weiler-Atherton
algorithm, we consider the view pane boundaries instead of edges
and vertices of the polygon.

Unlike Sutherland – Hodgman polygon clipping algorithm, this


algorithm is able to clip concave polygons without leaving any
residue behind

Algorithm of Weiler-Atherton Polygon Clipping

Step 1: First,create a list of intersection points that are in the starting


or ending state. (I1, I2……. In).

Step 2: Now, create two more lists; one for subject polygon and
other for clip polygon.Fill both lists with intersection points and
vertices of the polygon.

Order of Subject Polygon list- Write down all the vertices of the
polygon in the subject polygon column.

Order of Clip Polygon list – Write down the points of the clipping
window.

Step 3: Insert the vertices in both lists in such a way that the
intersection point exists between the correct vertices.
Step 4: Now, start from the first vertex of the polygon. Select the first
intersection point as an entering point and follow the same process
until we reach the exiting point.

Step 5: We can move from clip polygon list to subject polygon list
and search for the finishing intersection point. Repeat the process
until we find the entering point.

Step 6: Now, the polygon is being clipped. Repeat the same process
until each point has been visited once.

Step 7: Stop.

Example: Consider a polygon with vertices ABCDEFG. Apply Weiler-


Atherton algorithm to find the clipped polygon?

Solution: Let us assume that the vertices of window = C1, C2, C3, C4
The vertices of polygon = ABCDEFG
First, create two lists, one for subject polygon and second for clip
polygon.
Iteration 1-
The First new list is- A’, B, C, D’, A’.

Iteration 2-

The Second new list is - E’, E, F, F’,E’.


Limitations:
This polygon clipping algorithm does not work for self – intersecting polygons,
although some methods have been proposed to be able to solve this issue also,
and have successfully worked.

Let V1V2V3V4V5V6 be the clipping window and P1 P2 P3 P4 P5 P6 be the


polygon.
Now, here is how the algorithm will operate.
Two lists are generated, one for the clipping window, and the other for the
polygon. We will start from the polygon’s list. (Note that the polygon’s list only
contains the polygon’s vertices and the intersections and similarly for the
clipping window’s list.)
The ouput in this case:

You might also like