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

Simple item page
dc.contributor.authorSlater, Melen_US
dc.contributor.authorDrake, Kieronen_US
dc.contributor.authorDavison, Allanen_US
dc.contributor.authorKordakis, Emmanouell and Billyard, Adam and Miranda, Elioten_US
dc.date.accessioned2014-10-21T07:19:07Z
dc.date.available2014-10-21T07:19:07Z
dc.date.issued1992en_US
dc.description.abstractThis 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.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume11en_US
dc.identifier.doi10.1111/1467-8659.1120131en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages131-138en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1120131en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA Statistical Comparison of Two Hidden Surface Techniques: the Scan-line and Z-buffer Algorithmsen_US
Files
Collections
Issue 2