一种高效快速的裁剪算法

AN EFFICIENT AND QUICK CLIPPING ALGORITHM

本文的裁剪策略是,巧妙的利用窗口与线段的两种不同数学描述,将有效交点的判定、求交运算及包含性检验,归结为三个条件的判别。这三个条件形式简明,运算量小,整个裁剪过程,只有存在有效交点时才作一次除法,把除法减少到最低限度,从而大大提高了裁剪效率。

In this paper, an algorithm for clipping against a rectangular window is presented. By means of different mathematical representations of straight line segment, the process of clipping is reduced to the determination of three simple conditions. The idea of the algorithm is that in the entire process of clipping, determination is not more than that of other algorithms; division operations are needed only when the line segment to be clipped crosses the edges of the window; the edges of the window which do not cross the line segment to be clipped are quickly rejected. Thus, divisions and other calculations are reduced to their, min-mum and the efficiency of line clipping against a rectangular window is greatly improved.