Image and object order rendering

This is an old revision of this page, as edited by Nmellado (talk | contribs) at 10:48, 19 November 2024 (Add reference to Gross2007, which details in Chapter 2 the history of object and image order algorithms). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  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.