This algorithm divides a 2D space into 9 parts, of which only the middle part (viewport) is visible. The algorithm includes, excludes or partially includes the line based on where the two endpoints are:

• Both endpoints are in the viewport (bitwise OR of endpoints == 0): trivial accept.
• Both endpoints are in the same part, which is not visible (bitwise AND of endpoints != 0): trivial reject.
• Both endpoints are in different parts: In case of this non trivial situation the algorithm finds one of the two points that are outside the viewport (there is at least one point outside).

The intersection of the outpoint and extended viewport border is then calculated (i.e. with the parametric equation for the line) and this new point replaces the outpoint. The algorithm repeats until a trivial accept or reject occurs.

The numbers in the figure below are called outcodes. An outcode is computed for each of the two points in the line. The first bit is set to 1 if the point is above the viewport. The bits in the outcode represent: Top, Bottom, Right, Left. For example the outcode 1010 represents a point that is top-right of the viewport.

``````1001  |  1000  |  1010
-----------------------
|        |
0001  |  0000  |  0010
|        |
------------------------
|        |
0101  |  0100  |  0110
``````