任意多边形窗口的圆裁剪算法  

An Algorithm for Circle Clipping Against Polygon Window

作　　者：杭后俊[1] 孙丽萍[1] 

机构地区：[1]安徽师范大学数学计算机科学学院

出　　处：《计算机技术与发展》2009年第5期235-237,241,共4页Computer Technology and Development

基　　金：安徽省自然科学基金(2006kj076B);安徽师范大学青年基金(2008xqn47)

摘　　要：圆的裁剪广泛应用于诸如计算机图形学、二维计算机动画以及机器人运动学等领域。讨论了圆关于任意多边形窗口的一个裁剪算法,按逆时针方向依次求出多边形裁剪窗口的每条边与圆的交点并且保证交点正确排序,对于交点序列中的任意两相邻的交点,采用"中点检测法"来判定以它们为端点的圆弧与裁剪窗口的位置关系,最后给出完整的裁剪算法。实现结果表明,不论从效率还是稳定性方面都取得了比较理想的效果。Circle clipping is applied widely computer graphics, such as two dimension computer animation and robot kinematics etc. Discusses a circle clipping algorithm against the polygon window in detail. The intersection points of the circle and each side of the clipping window are calculated and sorted correctly. Regarding two neighbor intersection points in sequence, ＂the middle point detecting method ＂ is used to judge the position relations of circular arc and the clipping window. Finally, the whole clipping algorithm is gained, The result expresses that the algorithm is stable and efficient.

关 键 词：裁剪窗口 裁剪算法 求交算法 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]