A Statistical Comparison of Two Hidden Surface Techniques : the Scan-line and Z-buffer Algorithms

This paper compares two image space hidden surface removal algorithms for polygonal scenes. These are the z‐buffer and scan‐line algorithms. There is first an overview of each algorithm, followed by a simulation experiment, designed to compare the number of polygons per second which can be rendered by each algorithm. The simulation varies the number of polygons in the scene, and the size and distribution of polygons over the display. The results suggest that the z‐buffer is preferred for a large enough number of polygons, however, smaller polygons and uniform distribution of polygons favour the scan‐line approach. The analysis does not take into account the complexity of the shading rule, which is likely also to favour the scan‐line method. Copyright © 1992, Wiley Blackwell. All rights reserved