Another Simple but Faster Method for 2D Line Clipping

Abstract

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 lineclipping 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.

Line Clipping in 2D: Overview, Techniques and Algorithms

“…Each of the fundamental algorithms mentioned before has advantages and disadvantages. In 2019, Matthes and Drakopoulos introduced an efficient line-clipping algorithm [ 27 ] or [ 28 ] which aims at simplicity and speed and does only the necessary calculations in order to clip a line inside the clipping window.…”

Line Clipping in 3D: Overview, Techniques and Algorithms

“…This article proposes an algorithm for line clipping against a three-dimensional clipping region. The proposed algorithm is an extension of the algorithm described in [4] to the three-dimensional space.…”