一般多边形窗口的有效线裁剪算法  

Efficient Algorithm for Line Clipping against General Polygon

作　　者：赵平[1] 冯春[1] 李柏林[1] 

机构地区：[1]西南交通大学机械工程学院,四川成都610031

出　　处：《西南交通大学学报》2004年第1期64-68,共5页Journal of Southwest Jiaotong University

基　　金：国家863计划资助项目(2002AA411210);四川省学术和技术带头人培养资金项目(2200107);留学回国人员科研启动基金资助项目(教外司留[2001]498号)

摘　　要：在分析已有线裁剪算法优点和缺点的基础上,提出了一种新的一般多边形窗口线裁剪算法.这种新算法通过计算被裁剪线段和多边形各边的真实交点,利用交点将被裁剪线段分成若干子线段,用各子线段的中点来判断是否对它们实施裁剪.裁剪算法对各种情况都能快速、正确地得到结果.Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed. This algorithm is composed of three steps: the intersection points of a line to be clipped and a general polygon are calculated, the line is cut into several sub-lines based on the intersection points, and whether these sub-line are cut or not is decided in light of their central points. The algorithm can deal with all kinds of situations easily and correctly.

关 键 词：分割法 多边形窗口 计算机图形学 线裁剪 算法 

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