摘要
根据二维线段与矩形窗口顶点和对角线的位置关系 ,介绍一种二维线段的矩形窗口裁剪算法 ,以减少裁剪求交的次数 ,从而减少算法的运算量 ,达到快速裁剪线段的目的。
On the basis of relations between 2-D line segment with rectangle window's vertexes, diagonals and margins, a new 2-D line clipping algorithm with the least arithmetic operations is presented. .This algorithm is simple, clearly thinking in programming and speedy in calculating.
出处
《计算机与数字工程》
2004年第4期29-31,共3页
Computer & Digital Engineering
关键词
线段
裁剪
矩形窗口
计算机图形学
line segment,clipping, rectangle window, computer graphics
