Hidden Surface Elimination on Parallel Processors

Simple item page
dc.contributor.authorHighfield, Julian C.en_US
dc.contributor.authorBez, Helmut E.en_US
dc.date.accessioned2014-10-21T07:22:15Z
dc.date.available2014-10-21T07:22:15Z
dc.date.issued1992en_US
dc.description.abstractWith the wide availability of general purpose parallel computers, there is a need to reconsider hidden surface elimination (HSE) algorithms with respect to parallel implementation. This paper considers MIMD parallel implementations off our common image space HSE algorithms - recursive subdivision, scan line, painter s, and z-buffer. Their suitability for parallel implementation is investigated and their relative performance in multiprocessor systems is measured using polygonal scene descriptions of between 200 and 2500 polygons. Dependence on the size of scene description is measured and results are extrapolated to larger scene descriptions. It is shown that HSE algorithms may be efficiently parallelised. A distributed z-buffer is shown to be a fast and efficient method of solving HSE problems using parallel computers.en_US
dc.description.number5en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume11en_US
dc.identifier.doi10.1111/1467-8659.1150293en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages293-307en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.1150293en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleHidden Surface Elimination on Parallel Processorsen_US
Files
Collections
Issue 5