一种基于几何变换的高效的线裁剪新算法

线裁剪是计算机图形学的重要基础问题之一。在对现有的两种优秀算法作了分析之后提出一种利用简单几何变换，将裁剪问题简化为对两种基本情况的处理，并先后对被裁剪线段的首末端点作变换处理的新算法，有效地克服了上述两种方法中存在的调用函数多，基本情况处理复杂等弱点，理论分析和实例测试均表明，该算法优于当代国际最快的几种裁剪方法。

A New Efficient Line Clipping Algorithm Based on Geometric Transformation

Line clipping is one of the fundamental problems in computer graphics. In this paper, two well known algorithms are analyzed and a new algorithm, which simplifies the line clipping into the processes in two basic cases by doing simple transformation on two end points of a line in turn, is introduced. The algorithm effectively overrides the shortcomings existed in the above two algorithms such as too many subroutine calls and complex basic cases. Both theoretic analysis and example testing show that the new algorithm is better than well known algorithms.