论文标题
E3中线段锥体剪辑的新算法
A New Algorithm for Pyramidal Clipping of Line Segments in E3
论文作者
论文摘要
提出了一种针对E3中金字塔剪辑线段的新算法。该算法避免了不是输出线段端点的相交点的计算。它还允许更有效地解决所有情况。该算法的性能始终比现有算法更好，包括Cohen-Sutherland，Liang-Barsky和Cyrus-Beck算法。
A new algorithm for clipping a line segment against a pyramid in E3 is presented. This algorithm avoids computation of intersection points which are not end-points of the output line segment. It also allows solving all cases more effectively. The performance of this algorithm is shown to be consistently better than existing algorithms, including the Cohen-Sutherland, Liang-Barsky and Cyrus-Beck algorithms.
