%T Parallel Scan Line algorithm for Hidden Surface Elimination
%A Julian C. Highfield
%E Janet Edwards
%B Proceedings of WoTUG\-14: Occam and the Transputer\-Current Developments
%X With the general availability of general purpose parallel
computers, there is a need to reconsider scan conversion
algorithms with respect to their parallel implementation.
This paper considers MIMD parallel implementation of two
versions of the scan conversion algorithm, one the common
edge table optimisation, and one not. Their suitability for
parallel implementation is investigated and their relative
performance in multi\-processor systems is measured using
polygonal scene descriptions of between 150 and 2600
polygons. Dependence upon the size of scene description is
measured and results are extrapolated to larger scene
descriptions. It is shown that scan conversion algorithms
may be efficiently parallelised. It is also shown that the
edge table optimisation, while appropriate to the single
processor case, becomes useless at around twenty processors,
and would actually be a disadvantage in the limiting case of
one processor per scan line.
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org