Sciweavers

IPPS
1998
IEEE

An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains

13 years 7 months ago
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in Olog4 n steps on the CREW PRAM model with a work bound of On + kpolylogn where n and k are the input and output sizes respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data-structures is somewhat novel in the context of parallel algorithms. To the best of our knowledge this is the most efficient parallel algorithm for hidden-surface removal for an important class of 3-D scenes.
Neelima Gupta, Sandeep Sen
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Neelima Gupta, Sandeep Sen
Comments (0)