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

An efficient alorithm for the line clipping against general polyon

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

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

出　　处：《机械》2002年第4期34-35,48,共3页Machinery

摘　　要：在分析已有线裁剪算法优、缺点的基础上提出了一种新算法 ,该算法通过计算被裁剪线段和多边形各边的真实交点 ,利用交点将被裁剪线段分成若干子线段 ,用各子线段的中点来判断是否对它们实施裁剪。裁剪算法对各种情况都能快速。Based on the analysis of the advantages and disadvantages of existing algorithms, a new algorithm is presented. According to the intersection points of general polygon and clipped line,the clipped is cutted several line .the cutted line is in/out general polygon according to the central point of the cutted line. The algorithms can deal with all kinds of situations easily and correctly.

关 键 词：计算机图形学 多边形 线裁剪 

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