摘要
本文在分析已有裁剪算法优、缺点的基础上提出了一个新算法，该算法通过定义多边形的顶点类型、交点类型，裁剪算法对各种情况都能快速、正确地得到结果。
Based on the analysis of the advantages and disadvantages of existing algorithms,a new algorithm is presented.According to the types of polyon vertices and intersection points defined in this paper,the algorithm can deal with all kinds of situations easily and correctly.
出处
《计算机工程与科学》
CSCD
1999年第3期45-48,74,共5页
Computer Engineering & Science
关键词
多边形
窗口
线裁剪
图形处理
计算机图形学
general polygon,concave and convex point of polygon,line clipping.
