  The majority of methods for line clipping make a rather large number of
comparisons and involve a lot of calculations compared to modern ones. Most of
the times, they are not so efficient as well as not so simple and applicable to
the majority of cases. Besides the most popular ones, namely, Cohen-Sutherland,
Liang-Barsky, Cyrus-Beck and Nicholl-Lee-Nicholl, other line-clipping methods
have been presented over the years, each one having its own advantages and
disadvantages. In this paper a new computation method for 2D line clipping
against a rectangular window is introduced. The proposed method has been
compared with the afore-mentioned ones as well as with two others; namely,
Skala and Kodituwakku-Wijeweera-Chamikara, with respect to the number of
operations performed and the computation time. The performance of the proposed
method has been found to be better than all of the above-mentioned methods and
it is found to be very fast, simple and can be implemented easily in any
programming language or integrated development environment.
