48
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

An efficient parallel algorithm or visible-surface detection in 3d graphics display

, &
Pages 359-371 | Received 20 Jun 1996, Published online: 19 Mar 2007
 

Abstract

A major concern in generation of realistic graphics displays is how to identify those parts of a scene that are visible from a chosen viewing position. There have been various algorithms for identification of visible objects on both sequential and parallel computation models, all with different time and space requirements, depending on the properties of the underlying machine architectures and types of the objects. In this paper, we propose an efficient parallel algorithm for implementation of the popular depth-buffer method on the general PRAM model that detects visible surfaces by projecting pixels on all surfaces to a 2D view plane and removing all hidden surfaces. For a total of n pixels on the surfaces of an object, our algorithm runs cost-optimally in time in the average case, and in time in the worst case, using p processors on the EREW PRAM. We analyze the scalability of the algorithm and show that it is highly scalable in the average case.

C.R. Categories:

*Corresponding Author

*Corresponding Author

Notes

*Corresponding Author

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.