Title :
An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains
Author :
Gupta, Neelima ; Sen, Sandeep
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., New Delhi, India
fDate :
30 Mar-3 Apr 1998
Abstract :
We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log4 n) steps on the CREW PRAM model with a work bound of O((n+k)polylog(n)) 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
Keywords :
data structures; hidden feature removal; parallel algorithms; 3-D scenes; CREW PRAM model; hidden-surface removal; parallel algorithm; terrain maps; Algorithm design and analysis; Computer displays; Computer graphics; Computer science; History; Image segmentation; Layout; Parallel algorithms; Phase change random access memory; Rendering (computer graphics);
Conference_Titel :
Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-8404-6
DOI :
10.1109/IPPS.1998.669913