Fast Algorithms for Line Segment and Line Clipping in E 2

New modifications of the CohenSutherland algorithm for the line and line segment clipping in E 2 are presented. The suggested algorithms are based on a new coding technique based on coding of the line direction together with coding of end-points of the clipped line segment. It allows to solve all cases more effectively. The proposed algorithms are convenient for line or line segment clipping by the rectangle. Theoretical considerations and experimental results are also presented.