Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a22ed3c28dea4e12

Jump to content

Image and object order rendering

From Wikipedia, the free encyclopedia

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. Some volume-rendering methods do not fit cleanly into either category; for example, shear-warp rendering traverses both the volume and an intermediate image to combine image-order and object-order advantages.[3][4]

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.
  3. "Chapter 7 - Advanced Computer Graphics - VTK Book". VTK / Kitware.
  4. Lacroute, Philippe; Levoy, Marc (1994). "Fast Volume Rendering Using a Shear-Warp Factorization of the Viewing Transformation" (PDF). Stanford University / SIGGRAPH '94.