Algorithms for Parallel Polygon Rendering (Lecture Notes in Computer Science)

Description

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.

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Algorithms for Parallel Polygon Rendering (Lecture Notes in Computer Science)" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 2384
2. Algorithms for Parallel Polygon Rendering (Lecture Notes in Computer Science)
3. New Concepts for Parallel Object-Relational Query Processing (Lecture Notes in Computer Science)
4. Online Algorithms: The State of the Art (Lecture Notes in Computer Science)
5. Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)
6. Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science)
7. Algorithms for Memory Hierarchies: Advanced Lectures (Lecture Notes in Computer Science)
8. A Collection of Test Problems for Constrained Global Optimization Algorithms (Lecture Notes in Computer Science)
9. A Collection of Test Problems for Constrained Global Optimization Algorithms (Lecture Notes in Computer Science)
10. Evolution of Parallel Cellular Machines: The Cellular Programming Approach (Lecture Notes in Computer Science)
11. Fun with Algorithms: 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings (Lecture Notes in Computer Science)
12. Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (Lecture Notes in Computer Science)
13. The Use of Projective Geometry in Computer Graphics (Lecture Notes in Computer Science, Vol 564)
14. New Algorithms for Macromolecular Simulation (Lecture Notes in Computational Science and Engineering) (Repost)
15. Transactions on Computational Science I (Lecture Notes in Computer Science)
16. Transactions on Computational Science I (Lecture Notes in Computer Science)