Skip to main content
SpringerLink
Log in

Algorithms for Parallel Polygon Rendering

  • Book
  • © 1989

Overview

Editors:
  1. T. Theoharis
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 373)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Download chapter PDF

  2. 1 Introduction

    Pages 1-16

  3. 2 Graphics on general purpose parallel architectures

    Pages 17-31

  4. 3 A parallel incremental rendering method

    Pages 32-64

  5. 4 Parallel polygon rendering with precomputed surface patches

    Pages 65-86

  6. 5 Parallel polygon rendering on a dual-paradigm parallel processor

    Pages 87-111

  7. 6 Control parallel versus data parallel polygon clipping

    Pages 112-131

  8. 7 Conclusion

    Pages 132-134

  9. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation