Algorithm for Massive Contours Clipping Against General Polygon Window
Keyan Xiao · Journal of Chinese Computer Systems · 2011
Presented a new algorithm for massive Contour Clipping against General Polygon Window.The algorithm builds relationship of local topology between massive disorder line segments and edges of clipping polygon windows by using uniform grid segmentation,which reduces intersecting calculation among line segments.Secondly,based on these topological relations,using local ray method decreases time complexity generated by calculation of verifying point in general polygon windows.Thus,it could rapidly distinguish the reserve parts of contours that users needed.Furthermore,the algorithm makes itself more universal as a result of modifying shortage of pre-algorithms that polygon window cannot be a general polygon.