Image and object order rendering: Difference between revisions

Revision as of 17:24, 12 March 2011

Revision as of 10:29, 15 March 2012

Line 1:

{{Unreferenced|date=May 2009}}

In [[computer graphics]], '''image order''' [[algorithms]] iterate over the [[pixel]]s in the image to be produced, rather than the elements in the scene to be [[Rendering (computer graphics)|rendered]]. '''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 (fore.g. example,[[Geometric primitive|geometric primitiveprimitives]]) than the image pixels. In those cases, object order algorithms are usually most efficient (e.g. [[Rasterisation|scan conversion]] or [[Volume_rendering#Shear warp|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 (for examplee.g., [[Volume_rendering#ShearRay tracing warp(graphics)|shearray warpcasting]]) will usuallymay be more efficient.

[[Category:3D computer graphics]]