Skip to main content

3 A parallel incremental rendering method

  • Chapter
  • First Online:
Book cover Algorithms for Parallel Polygon Rendering

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

  • 140 Accesses

Abstract

In this Chapter we have shown how a processor array can efficiently evaluate bivariate linear functions and thus implement rendering operations. Cheap, incremental, computation is thus exploited in conjuction with parallelism on a parallel architecture which has come to be recognised as general purpose. Our algorithms map very naturally onto the processor array because they are based on the window which is the processor array's primitive graphical object. The evaluation method can be extended to non-linear functions at a cost which is dependent on the order of the function.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

T. Theoharis

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1989). 3 A parallel incremental rendering method. In: Theoharis, T. (eds) Algorithms for Parallel Polygon Rendering. Lecture Notes in Computer Science, vol 373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51394-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-51394-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51394-0

  • Online ISBN: 978-3-540-46204-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics