An
Efficient Line Clipping Algorithm in 2D Space
Mamatha Elliriki1,
Chandrasekhara Reddy2, and Krishna Anand3
1Department of Mathematics, GITAM
University, India
2Department of Mathematics, Cambridge
Institute of Technology-NC, India
3Department
of Computer Science, Sreenidhi Institute of Science and Technology, India
Abstract: Clipping
problem seems to be pretty simple from human perspective point of view since
with visualization a line can easily be traced whether it is completely inside
and if not what portion of the line lies outside the window. However, from
system point of view, the number of computations and comparisons for lines with
floating point calculations are extremely large which in turn adds to inherent
complexity. It needs to minimize the number of computations thereby achieving a
significant increase in terms of efficiency. In this work, a mathematical model
has been proposed for evaluating intersection points thereby clipping lines
which decently rely on integral calculations. Besides, no further computations
are found to be necessary for evaluating intersection points. The
performance of the algorithm seems to be consistently good in terms of speed for all sizes of clipping windows.
Keywords: Ortho lengths, raster
graphics system, line clipping, intersection points, geometrical slopes, rectangle
window.