Implementation of efficient line clipping algorithm

Abstract

This paper proposes a new and efficient line clipping algorithm against a two-dimensional rectangular window. As Cohen Sutherland line clipping algorithm uses four-bit binary codes and Liang Barsky line clipping algorithm uses parametric line equation to find the intersection points with rectangular window, the proposed algorithm uses simple line equation which makes the process of finding intersection points and process of clipping the line segment very simple and time efficient. Comparing to other algorithms of line clipping, the proposed algorithm is faster in terms of speed and more efficient for calculations.