Algorithms for 2D Line Clipping

Abstract

New algorithms for 2D line clipping against convex, non-convex windows and windows that consist of linear edges and arcs are being presented. Algorithms were derived from the Cohen-Sutherland 's and Liang-Barsky s algorithms. The general algorithm with linear edges and arcs can be used especially for engineering drafting systems. Algorithms are easy to modify in order to deal with holes too. The presented algorithms have been verified in TURBO-PASCAL. Because of the unifying approach to the clipping problem solution all algorithms are simple, easy to understand and implement.