摘要
根据多边形窗口各顶点与被裁剪线段的两端点分别在x轴、y轴上的坐标,首次提出窗口边界与被裁剪线段相交的必要条件,有效地排除与被裁剪线段不相交的多边形窗口边界,避免了求交带来的大量乘除法运算。算法思想简单,极大地提高了裁剪的效率。
The text brings forward the necessary condition of intersecting of line and window boundaries firstly, based the coordinates of window vertexes and end-points of line. Eliminates efficiently the window boundaries that don＇t intersect with the line, and averts vast operations. The algorithm idea is simple, and enhances the efficiency of clipping.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第1期149-150,156,共3页
Computer Applications and Software
关键词
计算机图形学
线裁剪
任意多边形
求交
Computer graphics Line clipping Arbitrary polygon Intersecting
