Parallel object-space hidden surface removal | Zendy

Wm. Randolph Franklin | Zendy; Mohan Kankanhalli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel object-space hidden surface removal

Author(s) -

Wm. Randolph Franklin,

Mohan Kankanhalli

Publication year - 1990

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/97879.97889

Subject(s) - speedup , sequent , computer science , parallelism (grammar) , grid , parallel computing , surface (topology) , object (grammar) , space (punctuation) , algorithm , computer vision , artificial intelligence , mathematics , geometry , programming language , operating system

A parallel object-space hidden surface removal algorithm for polyhedral scenes is presented. The uniform grid technique is used to achieve parallelism for the hidden line removal. A conflict-detection and back-off strategy is then used to obtain parallelism for the visible region reconstruction from the visible segments. The algorithm has been implemented on a Sequent Balance 21000 shared-memory parallel computer. An average speedup of 10 has been obtained using 15 processors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research