Another Simple but Faster Method for 2D Line Clipping

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.

[1]  K. R. Wijeweera,et al.  An Efficient Line Clipping Algorithm for 3D Space , 2012 .

[2]  Shi Kaijian,et al.  An efficient line clipping algorithm , 1990, Comput. Graph..

[3]  Bimal Kumar Ray,et al.  A Line Segment Clipping Algorithm in 2D , 2012 .

[4]  Swami Manohar,et al.  Line clipping revisited: Two efficient algorithms based on simple geometric observations , 1992, Comput. Graph..

[5]  D. T. Lee,et al.  An efficient new algorithm for 2-D line clipping: Its development and analysis , 1987, SIGGRAPH.

[6]  Mel Slater,et al.  2D line and polygon clipping based on space subdivision , 1994, The Visual Computer.

[7]  Václav Skala.  A new approach to line and line segment clipping in homogeneous coordinates , 2005, The Visual Computer.

[8]  Brian A. Barsky,et al.  A New Concept and Method for Line Clipping , 1984, TOGS.

[9]  Bimal Kumar Ray,et al.  An Alternative Algorithm for Line Clipping , 2012, J. Graph. Tools.

[10]  Michael Dörr,et al.  A new approach to parametric line clipping , 1990, Comput. Graph..

[11]  M. Pauline Baker,et al.  Computer Graphics, C Version , 1996 .

[12]  Jay Beck,et al.  Generalized two- and three-dimensional clipping , 1978, Comput. Graph..

[13]  End Semester Mca.  Computer Graphics with Open GL , 2009 .

[14]  Vasileios Drakopoulos,et al.  A Simple and Fast Line-Clipping Method as a Scratch Extension for Computer Graphics Education , 2019 .

[15]  Yee-Hong Yang,et al.  A fast two-dimensional line clipping algorithm via line encoding , 1987, Comput. Graph..

[16]  Qunsheng Peng,et al.  An efficient line clipping algorithm based on adaptive line rejection , 2002, Comput. Graph..

[17]  Vaclav Skala.  AN EFFICIENT ALGORITHM FOR LINE CLIPPING , 1993 .

[18]  Rumen Andreev,et al.  New algorithm for two-dimensional line clipping , 1991, Comput. Graph..

[19]  Václav Skala,et al.  An efficient algorithm for line clipping by convex polygon , 1993, Comput. Graph..

[20]  Sushil Chandra Dimri.  A Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics , 2015 .

[21]  Václav Skala,et al.  O(lg N) line clipping algorithm in E2 , 1994, Comput. Graph..

[22]  J. D. Day.  An algorithm for clipping lines in object and image space , 1992, Comput. Graph..