EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1938

Title: An improved output-size sensitive parallel algorithm for hidden-surface removal for terrains
Authors: Gupta, N
Sen, S
Keywords: hidden-surface removal
terrain maps
parallel algorithms
Issue Date: 1998
Citation: Parallel Processing Symposium, IPPS/SPDP Proceedings of the First Merged International and Symposium on Parallel and Distributed Processing, 215 - 219p.
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
URI: http://eprint.iitd.ac.in/dspace/handle/2074/1938
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
guptaimp1998.pdf58.32 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback