Algorithms for Parallel Polygon Rendering - Lecture Notes in Computer Science - Theoharis Theoharis - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540513940 - July 12, 1989
In case cover and title do not match, the title is correct

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

Price
S$ 71.50
excl. VAT

Ordered from remote warehouse

Expected delivery Jun 22 - Jul 2
Add to your iMusic wish list

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

Media Books     Paperback Book   (Book with soft cover and glued back)
Released July 12, 1989
ISBN13 9783540513940
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 160
Dimensions 155 × 235 × 8 mm   ·   231 g
Language English  

Mere med samme udgiver