AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS
USING VECTOR CALCULUS AND PARALLELIZATION
With the advent of digitization and the increasing abundance of graphics and image
processing tools, the use cases for cropping using circular windows have grown considerably.
This article presents an efficient clipping algorithm for line segments using circular and
vector calculus geometric features. Based on research with rectangular windows, this method
is proposed in the belief that calculations are more expensive (heavy) than other calculations.
Execution time can be drastically improved if we replace expensive computations with
cheaper computations. Cheaper computations can be computed even more efficiently using
parallelization, which improves time complexity. To develop the algorithm, the primitives
are used, first using the equation of the circle and parameterizing it, then the Liang-Barsky
algorithm was selected as the base algorithm, because this is one of the best algorithms in
terms of efficiency and implementation, 4 inequalities were found and then entered into the
algorithm. The tangential square acts as a clipping window for the Liang-Barsky algorithm.
The choice of LiangBarsky was made because it is one of the most efficient line trimming
algorithms also in terms of implementation. A point on the line segment is in the clipping
window itself.
The use of vector calculus occurs because the circle is at the origin and is crossed by a line
segment, so this calculation allows us to travel the distance and find the intersection points.
Parallelization of computation from the end point using multiple threads, this algorithm only
needed two threads based on the start points, each process produces a new point then the
process repeats until the end points are inside the circle. The interesting thing about this
article is that a new algorithm based on other algorithms using another method, and in the
end, it turned out to have Good results where the lines that are created have their endpoints
outside the circle and proceed to a parameterization combination. The ends would be outside
the circle if the result in both cases is 2 0, which is why we can say that there are 2
possibilities, that the line is also outside the square or is outside the circle, but inside the
square. In the first case we use the Liang Barsky algorithm, but for the second case a
perpendicular line must be drawn that goes from the center of the circle to the end line. From
the present article we could conclude that the proposed algorithm produces exactly the same
