Implementation of Efficient Line Clipping Algorithm
Deepali Dev1, Pooja Saharan2
1Deepali Dev, Department of Information Technology, ABES Engineering College, Ghaziabad, India.
2Pooja Saharan, Department of Computer Science, ABES Engineering College, Ghaziabad, India.
Manuscript received on 04 May 2019 | Revised Manuscript received on 09 May 2019 | Manuscript Published on 13 May 2019 | PP: 295-298 | Volume-8 Issue-7S May 2019 | Retrieval Number: G10530587S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: Line Clipping, Intersection Points.
Scope of the Article: Computer Science and Its Applications