Algorithms for Parallel Polygon Rendering - Lecture Notes in Computer Science - Theoharis Theoharis - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540513940 - 1989. gada 12. jūlijs
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Algorithms for Parallel Polygon Rendering - Lecture Notes in Computer Science 1989 edition

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 3. - 13. jūl.
Pievienot savam iMusic vēlmju sarakstam

This book is the result of the research in the implementation of polygon-based graphics operations on certain general purpose parallel processors; the aim is to provide a speed-up over sequential implementations of the graphics operations concerned, and the resulting software can be viewed as a subset of the application suites of the relevant parallel machines. A literature review and a brief description of the architectures considered give an introduction into the field. Most algorithms are consistently presented in an informally defined extension of the Occam language which includes Single Instruction Multiple Data stream (SIMD) data types and operations on them. Original methods for polygon rendering - including the operations of filling, hidden surface elimination and smooth shading - are presented for SIMD architectures like the DAP and for a dual-paradigm (SIMD-MIMD) machine constructed out of a DAP-like processor array and a transputer network. Polygon clipping algorithms for both transputer and the DAP are described and contrasted. Apart from the information presented in the book and the useful literature survey, the reader can also expect to gain an insight into the programming of the relevant parallel machines.


160 pages, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1989. gada 12. jūlijs
ISBN13 9783540513940
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 160
Izmēri 155 × 235 × 8 mm   ·   231 g
Valoda Angļu  

Mere med samme udgiver