Cohen Sutherland Line Clippings Algorithm

Question

Describe Cohen Sutherland Line Clippings Algorithm in brief?

Answer 1

In Cohen Sutherland Line Clipping, the clipping trouble is simplified by dividing the region surrounding the window region into the four segments, up, down, left, right, (or UDLR) and allocation of number 1 and 0 to corresponding segments helps in positioning the area surrounding the window. But the restriction of Cohen Sutherland Line Clippings is that this algorithm is just valid to rectangular windows and not to  other convex shaped window.