Clipping Algorithm for Even-Odd Filling
Original Publication Date: 1988-Jun-01
Included in the Prior Art Database: 2005-Feb-15
This article describes an algorithm of boundary clipping which is used to even-odd fill the graphics APA (all-point addressable) plane. This algorithm has not been implemented by the famous Cohen-Sutherland clipping algorithm. The distinctive feature of this algorithm is as follows: (Image Omitted) Excellent performance because of its minimum calculation of intersection, No dependence upon any hardware configuration, Easy expandability into the Cohen-Sutherland clipping algorithm. This algorithm begins with assignment of outcode to start and end positions. This is the same method as the Cohen-Sutherland's algorithm. Next, it checks the following condition by inspecting the outcode. Trivial reject condition (the left part of Fig. 1) .