A Midpoint Segmentation Clipping Algorithm of Circular Window against Line

Based on the analysis of the traditional algorithm, this paper proposes a clipping algorithm for line segments against circular windows. Firstly divides the relationships between line segment and circle into five types and defines them. By using combination of region coding and distance square method, relationships are all determined. Which will avoid determination of intersection points between line segment and circle. Then solve the intersection points of circle and line segment by using middle point segment method, which avoids solution of quadratic equations and square root operations. Finally gives a detailed and feasible clipping algorithm of circular against line, after that gives the computational complexity analysis. In the end lists the method´s advantages. Experiments show that the proposed algorithm is efficient and effective.