一种快速的圆形窗口线裁剪算法  

A Fast Clipping Algorithm of Line Against Circular Window

作　　者：袁红亮[1] 孙健[1] 吴永忠[1] 

机构地区：[1]广东工业大学机电工程学院CIMS实验室,广州510090

出　　处：《计算机工程与应用》2004年第21期104-107,共4页Computer Engineering and Applications

摘　　要：文章利用圆的外切正六边形和内接正六边形对裁剪平面进行编码,能够快速地判定大部分的线段与圆形窗口之间的位置关系,然后对两者的位置关系进行进一步细分,从而决定是否要进行求交,减少了无谓的求交运算,而且前面判断得到的结果还在一定程度上加快了后面的求交过程。实验结果表明,该算法有较高的效率和可靠性。By encoding with the inscribed-hexagon and circumscribed-hexagon,it gets the position of most lines relative to circular window rapidly.Then,the position of lines is classified in detail in order to decide whether needs to calcu-late the intersection between line segment and circle,which reduce the unnecessary calculation.Moreover,in some ex-tent ,former result can be used to quickly calculate the intersection between line segment and circle.Experiment results show that the new algorithm has high efficiency and good stability.

关 键 词：圆形窗口 线裁剪 算法 

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