A New Algorithm for Pyramidal Clipping of Line Segments in E 3

A new algorithm for clipping a line segment against a pyramid in E 3 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.