A clipping algorithm for complex2 D graphs based on the robust intersection points seeking method is presented.
首先对于矩形窗口，介绍了直线裁剪算法，圆和椭圆裁剪算法以及参数曲线的裁剪算法。
Based on the analysis of advantages and disadvantages of the existing algorithms, a new algorithm for line clipping was proposed.
在分析已有线裁剪算法优点和缺点的基础上，提出了一种新的一般多边形窗口线裁剪算法。
Clipping algorithm is an basic algorithm in the Computer Graphics and the base of a lot of important task.
裁剪算法是计算机图形学中的基本算法，也是其它诸多重要问题的基础。
应用推荐