An efficient algorithm for polygon clipping based on intersection points sorting
Peng Jie · Journal of Zhejiang University(Science Edition) · 2012
An efficient algorithm for polygon clipping is proposed.The algorithm inserts the vertexes of clipping and clips polygon which are made up of the result polygon into the intersection points list.By sorting the intersection points,we will get a directional linked and single-pointer vertexes list of result polygons.This algorithm optimizes the data structure of intersection points and reduces the calculation times.Finally,by compared with other congener algorithms,the new algorithm is verified to be more efficient.