THE COMPUTATIONAL COST OF CLIPPING IN PARALLEL IMAGE PROCESSING

THE COMPUTATIONAL COST OF CLIPPING IN PARALLEL IMAGE PROCESSING

When distributing the object data for rendering in a MIMD network all erroneous data must be clipped against each of the subdivisions of the image space which have been allocated to the individual processors. This process of clipping entails an added computational cost to that of the actual renderin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel algorithms and applications 1995-01, Vol.5 (1-2), p.149-160
1. Verfasser: CHRISTIE, RUTH
Format: Artikel
Sprache:eng
Schlagworte:
Clipping
hidden surface removal
MIMD
Parallel processing
subdivision algorithm
transputer
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:When distributing the object data for rendering in a MIMD network all erroneous data must be clipped against each of the subdivisions of the image space which have been allocated to the individual processors. This process of clipping entails an added computational cost to that of the actual rendering algorithm. This paper looks at the effect of clipping on rendering in a parallel environment and determines a way of minimising the computational cost of that clipping when using a Transputer network.
ISSN:1063-7192
DOI:10.1080/10637199508915481