Clipping polygons

Clipping polygons

The basic idea of the Cohen-Sutherland algorithm on clipping polygons into a
display box lies in the fact that we clip a convex polygon consecutively by the individual lines forming the
display box limits
[FER95].

However, in the course of such consecutive clipping we should take care
to avoid the breaking of this polygon into incoherent parts. Clipping into the display box can be divided
into four steps, always in accordance with one side of this display box. Details on this algorithm are given
in [FER95].

Clipping non-convex polygons can be divided into a sequence of clipping convex polygons.