Line Clipping against Arbitrary Polygonal Window
Bimal Kumar Ray · International Journal of Computer Graphics · 2015
The Cyrus-Beck algorithm clips line against convex polygonal window, but it fails to clip line against concave and self-intersecting window because of the underlying assumption made in the design of the algorithm. This paper extends Skalas algorithm to design and develop a line clipping algorithm that clips a line against arbitrary polygonal window - any number of sides, convex, concave and self-intersecting and in contrast to the Cyrus-Beck algorithm, it does not compute false intersection.