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 sovle 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,afier that gives the computational complexity analysis. In the end lists the methods advantages . Eexperiments show that the proposed algorithm is efficient and effective.
line clipping1 circular window2 region encoding3 distance square4 midpoint5
Chen Chao Zhang Zhaoyin Sun changsong
College of Computer Science and Technology, Heilongjiang University, Harbin 150080, China College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
国际会议
重庆
英文
15-19
2009-12-25（万方平台首次上网日期，不代表论文的发表时间）