对Cohen-sutherland线段裁剪算法的分析及改进  

Analysis and Inprovement of Cohen-Suterland Line Clipping Algorithm

作　　者：王慧玲[1] 冯雪花[1] 

机构地区：[1]伊犁师范学院计算机科学系,新疆伊宁835000

出　　处：《伊犁师范学院学报（自然科学版）》2008年第4期38-41,共4页Journal of Yili Normal University：Natural Science Edition

摘　　要：研究分析了cohen-sutherland线段裁剪算法,针对cohen-sutherland线段裁剪算法不能有效地判断出所有完全位于窗口之外线段的情况,通过添加判断条件,能够判断出所有完全位于裁剪窗口之外的线段,从而减少了求交点的次数,提高了算法的运算效率.Study and analysis the Cohen-Suterland Line Clipping Algorithm, Amming at the problom of the Cohen-Suterland Line Clipping Algorithm can't effectively judge those lines completely outside. By adding a judging condition, all the lines that completely outside can be filter out. Decreased the times of calculate intersections, enhanced the efficiency.

关 键 词：裁剪算法 cohen-sutherland线段裁剪算法 无效交点 二分法 求交运算 

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