A comparison of two hidden surface removal algorithms
Recently there has been a greater need for using computers to produce pictures for 3D opaque objects. Because most practical display devices are 2D, 3D objects must be projected into 2D display devices, with the considerable attendant loss of information which can sometimes create ambiguities in the image. In the real world, the opaque material of objects obstructs the light rays from hidden parts and prevents us from seeing them. Nevertheless, when we use a computer to generate an image, no such automatic elimination would take place when 3D objects are projected onto the 2D projection plane. Therefore, we must apply a hidden-line or hidden-surface removal algorithm to the set of objects. In this thesis, we implement two hidden-surface removal algorithms, and then compare their performance to give us clues to which algorithm to use under different conditions.