Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
