Algorithms for Parallel Polygon Rendering - Lecture Notes in Computer Science - Theoharis Theoharis - 書籍 - Springer-Verlag Berlin and Heidelberg Gm - 9783540513940 - 1989年7月12日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

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

価格
¥ 8.825
税抜

遠隔倉庫からの取り寄せ

発送予定日 年7月13日 - 年7月23日

お客様の声：

EU消費者保護法に基づく14日間の返品ポリシー
Trustpilotで高評価
iMusicのウィッシュリストに追加

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

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 1989年7月12日
ISBN13 9783540513940
出版社 Springer-Verlag Berlin and Heidelberg Gm
ページ数 160
寸法 155 × 235 × 8 mm   ·   231 g
言語 英語  

Mere med samme udgiver

Theoharis Theoharisのすべてを見る ( 例： Paperback Book )