This document discusses the polygon clipping algorithm. It provides the name and details of the student discussing the concept, which involves clipping polygons using a clipping window to determine polygons that are inside, outside or intersecting the clipping region. Several examples are provided to illustrate how the algorithm handles different polygon configurations intersecting the clipping window.

1. Polygon Clipping
Algorithm
NAME :- RUSHIKESH KADAM
ROLL NO :- 318(T.Y CSE)
BATCH:- T1

2. CONCEPT
POLYGON
CLIPPING
CLIPPING
WINDOW
OUTSIDE
I N S I D E
PICTURE

3. 1
2
.
3
4

4. EXAMPLE
V1 V2
V1’

5. EXAMPLE
V3
V2
V1’
V1

6. EXAMPLE
V3
V2
V1’
V1
V4
V3’

7. EXAMPLE
V3
V2
V1’
V1
V4
V3’

8. THANK YOU