Answers are grounded in this paper and cite their sources.
A parallel object-space hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflict-detection and back-off strategy is then used to obtain parallelism for the visible region reconstruction from the visible segments. The algorithm has been implemented on a Sequent Balance 21000 shared-memory parallel computer. An average speedup of 10 has been obtained using 15 processors.
No takes yet. Share an insight, caveat, or question.
Franklin et al. (1990) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: