Gupta, N. ; Sen, S. (2001) An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains Algorithmica, 31 (2). pp. 179-207. ISSN 0178-4617
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/drmtu8kulpk24h...
Related URL: http://dx.doi.org/10.1007/s00453-001-0042-6
Abstract
We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log 4n) 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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| Keywords: | Parallel Algorithms; Hidden Surface Elimination; Output-sensitive; Data Structure; Terrain |
| ID Code: | 53433 |
| Deposited On: | 08 Aug 2011 12:09 |
| Last Modified: | 08 Aug 2011 12:09 |
Repository Staff Only: item control page
