Non-self-intersecting Polygon New Clipping Algorithm Based on VC

There are two advantages of the classic basis clipping algorithms on computer graphics,one is to add some additionals to improve the efficiency,the other is suit for certain environment.So it describes principle of the clipping algorithms and compares them to propose a new non-self-intersection polygon clipping algorithm.The algorithm is based on the control of line,the intersection of line using Liang Dong-barskey algorithm,and then find the polygon segment unit combination from the cutting unit group.between the clipping polygon with ring and without ring,and describes the steps and algorithmic processing clearly,at last,using C+ + to express the new algorithm to instantiate polygon clipping,through the test we prove that this algorithm is very effective for self-intersecting polygons,while the use of this algorithm is also able to resolve clipping problems between the polygon and polyline.,it works better on project.