基于线段与线段求交的矩形窗口裁剪算法  

A Clipping Algorithm for Rectangular Windows Based on Line Segment Intersection

作　　者：刘中琦[1] 秦敬超[1] 聂如春[1] 

机构地区：[1]中国矿业大学机械基础与CAD实验室

出　　处：《计算机工程与科学》2000年第2期22-24,共3页Computer Engineering & Science

摘　　要：我们首先对线段是否完全可见进行判定 ,然后对被裁剪线段与矩形窗口四边所在的线段是否相交进行判定并求交。若交点存在则用替换法替换相应的点 ,最后连接被替换后的点得到被裁剪后的线段 ;若交点不存在则线段完全不可见 ,线段将被完全裁剪掉。We first judge whether line segments are totally visible or not,then decide if there exist the intersectional points of a clipped line segment and the four line segments that compose the rectangular window.If the intersectional points exist,a subsitution method is used to replace the corresponding points,finally the replaced points are connected to get the clipped line segment.If the intersectional points do not exist,then the line segment is out of the rectangular window completely,the line segment would be cilipped completely.

关 键 词：线段 交点 矩形窗口 裁剪算法 

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