Clipping problem and planar convex polygon

The paper provides the clipping algorithm for planar convex polygon problem. The algorithm is based on the classification of the vertices of an arbitrary planar figure relative to a convex polygon. In many cases this classification allows to avoid unnecessary calculations such as calculating of coordinates for points of the intersection of arbitrary figure sides with polygon sides.