一种高效的圆形窗口线段裁剪算法  

Line Segment Clipping Algorithm Against Circular Window with high Efficiency

作　　者：任洪海[1] 

机构地区：[1]大连交通大学软件学院,辽宁大连116052

出　　处：《大连交通大学学报》2010年第6期95-97,共3页Journal of Dalian Jiaotong University

摘　　要：在圆形窗口线段裁剪过程中,当两端点都在窗口之外时情况较为复杂.从较远端点向圆形窗口引切线,通过判断点相对于两切线以及垂直于切线的两圆半径所在直线的位置关系,确定被裁剪线段是否与圆形窗口相交,只对有交点的情况才进行求交运算.实验结果表明,本算法明显提高裁剪效率.In line clipping algorithm against circular window,more complex case is occured when two endpoints of a line segment are outside of circular window.The tangents of circular window is made form the father endpoint,and the intersection is determined by region distribution of the endpoints relative to two tangents and the lines perpendicular to the tangent and the radius lie.The intersections are calculated to find out if the intersections are existed.The experimental results prove that the algorithm improves the clipping efficiency.

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

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