Daniel Nyberg
Analysis of two common hidden surface removal algorithms, Painter's algorithm & Z-buffering
Abstract
This report addresses two algorithms within the eld of hidden surface removal; Painter's algorithm and Z-buffering. An introduction is rst made into the domain of computer generated graphics and more specically hidden surface removal within that area, discussing methods of culling and denitions within hidden surface removal. The following sections documents the implementation, strengths, and weaknesses of the two algorithms as well as shortly discussing the data structure known as Binary Space Partitioning. An analysis is then given, comparing the algorithms with the help of specic scenarios. Finally, a discussion of combining the algorithms together with Binary Space Partitioning is given, labeling the strengths and weaknesses of this particular combination.