Abstract
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.
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.
