Circle Clipping Algorithm Based on Intersection Features of Vector
Chen Ding-y · Modern Computer · 2014
Proposes a new algorithm of circle clipping against rectangular window based on the Weiler-Atherton algorithm. To calculate the intersection points simply and fast, it defines the intersection features with the window edge. Before doing the seek loop, it ingeniously merges the start and end point of arc into the intersection list that includes out and points. As a result, it avoids the sort operation for intersection points of arc, and simply gets the clipped arc segments and the result of whole in or whole out. The practical application proves that the algorithm is stable and strong practicability.