We used a modified Newell, Newell and Sancha Z-sorting:
  • Sort faces into furthest minimum-Z-order to nearest
  • For each face, check faces it may overlap with
  • See if any are behind face being tested
  • If so, move this face behind it
  • Modification ignores overlapping cases

The biggest problem we had was that the algorithm given in several of the standard text books is incorrect!

We constructed this figure as a major test for the algorithm.

No SVG Support

Figure 8.1: Checking Z-order