Hardware Clipping Comparator
Original Publication Date: 1986-Jun-01
Included in the Prior Art Database: 2005-Mar-09
A hardware implementation of a clipping comparator is shown for handling cases of trivial except/reject in computer graphics. The hardware implementation can potentially reduce processing time by a factor of 3 to 5. In computer graphics, the primitives are points and lines. A box in three dimension or rectangle in two dimension is defined by the user to determine the visibility of the objects, that is, a point or portion of a line is visible if it is inside the box or rectangle. The process of removing the invisible part against the box is called clipping. In the two-dimensional case, let xmin, xmax, ymin, and ymax be the boundaries of the rectangle (clipping window). For each point, the Cohen- Sutherland algorithm defines the four-bit outcode.