摘要
已有的多边形裁剪算法都是针对矩形窗口或凸多边形窗口进行的。但是,在实际应用中,也常常使用圆形窗口对多边形区域进行裁剪和填充。因此,本文提出了一个对于圆形窗口的凸多边形区域裁剪算法,并且给出了作出凸多边形P在窗口V之内部分的定理。
Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window. But polygon clipping and tilling against a circle is often required in practical use. In this paper, a convex polygon clipping algorithm based on a circle is presented. A theorem about a convex polygon P within 1
a circular window V is also given.
出处
《计算机应用与软件》
CSCD
1995年第4期48-53,共6页
Computer Applications and Software
关键词
计算机图形学
圆形窗口
凸多边形裁剪
Computer graphics, circular window, convex polygon clipping.
