Algorithms for parallel polygon rendering / T. Theoharis.

By: Theoharis, T. (Theoharis), 1964-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 373.Publisher: Berlin ; New York : Springer-Verlag, ©1989Description: 1 online resource (vii, 147 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540462040; 354046204XSubject(s): Parallel processing (Electronic computers) | Computer algorithms | Rendering (Computer graphics) | Polygons | Parallélisme (Informatique) | Algorithmes | Infographie | Polygones | Computer algorithms | Parallel processing (Electronic computers) | Polygons | Rendering (Computer graphics) | RenderingGenre/Form: Electronic books. Additional physical formats: Print version:: Algorithms for parallel polygon rendering.DDC classification: 004/.35 LOC classification: QA76.5 | .T52 1989Other classification: 54.72 | 54.73 | *68-02 | 68N25 | 68Q25 | 68U99 | 27 | 28 Online resources: Click here to access online Action note: digitized 2010 committed to preserveSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references (pages 143-147).

Use copy Restrictions unspecified MiAaHDL star

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve MiAaHDL pda

Print version record.

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.

There are no comments for this item.

to post a comment.

Powered by Koha