Hidden surface elimination for complex graphical scenes
S. Boinodiris · ACM SIGGRAPH Computer Graphics · 1981
An extension to the Algorithm of Recursive Descent, introduced by Clark is presented for improving high speed techniques in hidden surface elimination. Whenever the average number of opaque primitives per occupied raster element becomes large, the algorithm presented tends to eliminate unnecessary depth evaluations. In complex graphical scenes which are executed by parallel processing structures interactively, the presented algorithm may provide considerable processing savings in related computer graphics processes.