The following work proposes a versatile algorithm
for clipping line against convex polygon windows. As compared
to other algorithms like Cyrus-Beck and Skala algorithm, this
algorithm avoids floating point calculations to speed up the line
drawing technique. The following paper uses a unique midpoint
split technique along with parallelization to find the line without
finding the point of intersections. Since this algorithm doesn't
follow the slope based methodologies, it doesn't need floating point registers.
