Jump to content

Image and object order rendering

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by WikiCleanerBot (talk | contribs) at 04:27, 28 November 2024 (v2.05b - Bot T20 CW#61 - Fix errors for CW project (Reference before punctuation)). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer graphics, image order algorithms iterate over the pixels in the image to be produced, rather than the elements in the scene to be rendered.[1][2] Object order algorithms are those that iterate over the elements in the scene to be rendered, rather than the pixels in the image to be produced. For typical rendering applications, the scene contains many fewer elements (e.g. geometric primitives) than image pixels. In those cases, object order algorithms are usually most efficient (e.g. scan conversion or shear warp). But when the scene complexity exceeds that of the image, such as is the case often in volume rendering, then image order algorithms (e.g., ray casting) may be more efficient.

References

[edit]
  1. ^ Isaac Bankman (24 December 2008). Handbook of Medical Image Processing and Analysis. Elsevier. pp. 789–. ISBN 978-0-08-055914-8.
  2. ^ Markus Gross, Hanspeter Pfister (2007). Point-Based Graphics. Elsevier. pp. 525–. ISBN 9780123706041.