摘要
已有的线裁剪算法都是针对矩形窗口或凸多边形窗口的。对于一般的多边形窗口(包括凹多边形)的线裁剪,目前尚无有效的算法。开发这种算法是很必要的,因为它在计算机图形学中有很广泛的应用,如物体的消隐处理等。因此,提出一个对于一般多边形窗口的线裁剪算法,并给出了最优实现。
Existing line clipping algorithms are all offered based on a rectangular window or a convex polygonal window. No algorithm for line clipping based on a generalized polygon (or concave polygon) is available in the literature. It is quite valuable to develop such algorithms, because they are of practical use just like the hidden line problem. In this paper, a line clipping algorithm based on a generalized polygon is presented. The calculation effort of the algorithm is small.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
1993年第4期269-274,共6页
Journal of Computer-Aided Design & Computer Graphics
关键词
计算机图形学
多边形窗口
线裁剪
Computer graphics, concave polygonal window, line clipping, intersection calculating.
