Generalized Depth Candidacy Reduction Theorem and its Application
Original Publication Date: 1980-Jul-01
Included in the Prior Art Database: 2005-Feb-13
A method is described which reduces the amount of primitives to be sorted for visibility and shading in computer graphics. Whenever computer graphics deals with the determination of visible primitives in a given raster element, this visibility is determined by sorting the depths of all the primitives that are contesting such visibility. For a scene of few primitives, this method is adequately efficient. Whenever, though, the number of primitives for a given raster element is large, this method is unnecessarily long since it involves the depth determination (which, many times, is associated with shading calculations as well) for each primitive in the contest. These calculations are normally long in nature.