Rendering (computer graphics)

A variety of rendering techniques applied to a single 3D scene

An image created by using POV-Ray 3.6

Rendering or image synthesis is the process of generating a photorealistic or non-photorealistic image from a 2D or 3D model by means of a computer program.^{[citation needed]} The resulting image is referred to as the render. Multiple models can be defined in a scene file containing objects in a strictly defined language or data structure. The scene file contains geometry, viewpoint, texture, lighting, and shading information describing the virtual scene. The data contained in the scene file is then passed to a rendering program to be processed and output to a digital image or raster graphics image file. The term "rendering" is analogous to the concept of an artist's impression of a scene. The term "rendering" is also used to describe the process of calculating effects in a video editing program to produce the final video output.

Rendering is one of the major sub-topics of 3D computer graphics, and in practice it is always connected to the others. It is the last major step in the graphics pipeline, giving models and animation their final appearance. With the increasing sophistication of computer graphics since the 1970s, it has become a more distinct subject.

Rendering has uses in architecture, video games, simulators, movie and TV visual effects, and design visualization, each employing a different balance of features and techniques. A wide variety of renderers are available for use. Some are integrated into larger modeling and animation packages, some are stand-alone, and some are free open-source projects. On the inside, a renderer is a carefully engineered program based on multiple disciplines, including light physics, visual perception, mathematics, and software development.

Though the technical details of rendering methods vary, the general challenges to overcome in producing a 2D image on a screen from a 3D representation stored in a scene file are handled by the graphics pipeline in a rendering device such as a GPU. A GPU is a purpose-built device that assists a CPU in performing complex rendering calculations. If a scene is to look relatively realistic and predictable under virtual lighting, the rendering software must solve the rendering equation. The rendering equation does not account for all lighting phenomena, but instead acts as a general lighting model for computer-generated imagery.

In the case of 3D graphics, scenes can be pre-rendered or generated in realtime. Pre-rendering is a slow, computationally intensive process that is typically used for movie creation, where scenes can be generated ahead of time, while real-time rendering is often done for 3D video games and other applications that must dynamically create scenes. 3D hardware accelerators can improve realtime rendering performance.

Usage

When the pre-image (a wireframe sketch usually) is complete, rendering is used, which adds in bitmap textures or procedural textures, lights, bump mapping and relative position to other objects. The result is a completed image the consumer or intended viewer sees.

For movie animations, several images (frames) must be rendered, and stitched together in a program capable of making an animation of this sort. Most 3D image editing programs can do this.

Features

A rendered image can be understood in terms of a number of visible features. Rendering research and development has been largely motivated by finding ways to simulate these efficiently. Some relate directly to particular algorithms and techniques, while others are produced together.

• Shading – how the color and brightness of a surface varies with lighting
• Texture-mapping – a method of applying detail to surfaces
• Bump-mapping – a method of simulating small-scale bumpiness on surfaces
• Fogging/participating medium – how light dims when passing through non-clear atmosphere or air
• Shadows – the effect of obstructing light
• Soft shadows – varying darkness caused by partially obscured light sources
• Reflection – mirror-like or highly glossy reflection
• Transparency (optics), transparency (graphic) or opacity – sharp transmission of light through solid objects
• Translucency – highly scattered transmission of light through solid objects
• Refraction – bending of light associated with transparency
• Diffraction – bending, spreading, and interference of light passing by an object or aperture that disrupts the ray
• Indirect illumination – surfaces illuminated by light reflected off other surfaces, rather than directly from a light source (also known as global illumination)
• Caustics (a form of indirect illumination) – reflection of light off a shiny object, or focusing of light through a transparent object, to produce bright highlights on another object
• Depth of field – objects appear blurry or out of focus when too far in front of or behind the object in focus
• Motion blur – objects appear blurry due to high-speed motion, or the motion of the camera
• Non-photorealistic rendering – rendering of scenes in an artistic style, intended to look like a painting or drawing

Techniques

Many rendering algorithms have been researched, and software used for rendering may employ a number of different techniques to obtain a final image.

Choosing how to render a scene usually involves a trade-off between speed and realism (although realism is not always desired). The techniques developed over the years follow a loose progression, with more advanced methods becoming practical as computing power and memory capacity increased.

An important distinction is between image order algorithms, which iterate over pixels of the image plane, and object order algorithms, which iterate over objects in the scene. For simple scenes, object order is usually more efficient, as there are fewer objects than pixels.

Rasterization (including scanline rendering)

Geometrically projects objects in the scene to an image plane. Different realistic or stylized effects can be obtained by coloring the pixels covered by the objects in different ways. Surfaces are typically divided into meshes of triangles before being rasterized. Rasterization is usually synonymous with "object order" rendering (as described above).

Ray casting

Uses geometric formulas to compute the first object that a ray intersects.^[1]:8 It can be used to implement "image order" rendering by casting a ray for each pixel, and finding a corresponding point in the scene. Ray casting is a fundamental operation used for both graphical and non-graphical purposes,^[1]:6 e.g. determining whether a point is in shadow, or checking what an enemy can see in a game.

Ray tracing

Simulates the bouncing paths of light caused by specular reflection and refraction, requiring a varying number of ray casting operations for each path. Advanced forms use Monte Carlo techniques to render effects such as area lights, depth of field, blurry reflections, and soft shadows, but computing global illumination is usually in the domain of path tracing.^[1]:9-13[2]

Path tracing

Uses Monte Carlo integration with a simplified form of ray tracing, computing the average brightness of a sample of the possible paths that a photon could take when traveling from a light source to the camera (for some images, thousands of paths need to be sampled per pixel^[1]:8). It was introduced as a statistically unbiased way to solve the rendering equation, giving ray tracing a rigorous mathematical foundation.^[3][1]:11-13

Radiosity

A finite element analysis approach that breaks surfaces in the scene into pieces, and estimates the amount of light that each piece receives from light sources, or indirectly from other surfaces. Once the irradiance of each surface is known, the scene can be rendered using rasterization or ray tracing.^{[4]:888-890, 1044-1045}

Each of the above approaches has many variations, and there is some overlap. Path tracing may be considered either a distinct technique or a particular type of ray tracing.^{[4]:846, 1021} Note that the usage of terminology related to ray tracing and path tracing has changed significantly over time.^[1]:7

Rendering of a fractal terrain by ray marching

Ray marching is a family of algorithms, used by ray casting, for finding intersections between a ray and a complex object, such as a volumetric dataset or a surface defined by a signed distance function. It is not, by itself, a rendering method, but it can be incorporated into ray tracing and path tracing, and is used by rasterization to implement screen-space reflection and other effects.^[1]:13

A technique called photon mapping or photon tracing uses forward ray tracing (also called particle tracing), tracing paths of photons from a light source to an object, rather than backward from the camera. The additional data collected by this process is used together with conventional backward ray tracing or path tracing.^{[4]:1037-1039} Rendering a scene using only forward ray tracing is impractical, even though it corresponds more closely to reality, because a huge number of photons would need to be simulated, only a tiny fraction of which actually hit the camera.^[5]:7-9

Real-time rendering, including video game graphics, typically uses rasterization, but increasingly combines it with ray tracing and path tracing.^[6]:2 To enable realistic global illumination, real-time rendering often relies on pre-rendered ("baked") lighting for stationary objects. For moving objects, it may use a technique called light probes, in which lighting is recorded by rendering omnidirectional views of the scene at chosen points in space (often points on a grid to allow easier interpolation). These are similar to environment maps, but typically use a very low resolution or an approximation such as spherical harmonics.^[7] (Note: Blender uses the term 'light probes' for a more general class of pre-recorded lighting data, including reflection maps.^[8])

Scanline rendering and rasterization

Rendering of the Extremely Large Telescope

A high-level representation of an image necessarily contains elements in a different domain from pixels. These elements are referred to as primitives. In a schematic drawing, for instance, line segments and curves might be primitives. In a graphical user interface, windows and buttons might be the primitives. In rendering of 3D models, triangles and polygons in space might be primitives.

If a pixel-by-pixel (image order) approach to rendering is impractical or too slow for some task, then a primitive-by-primitive (object order) approach to rendering may prove useful. Here, one loop through each of the primitives, determines which pixels in the image it affects, and modifies those pixels accordingly. This is called rasterization, and is the rendering method used by all current graphics cards.

Rasterization is frequently faster than pixel-by-pixel rendering. First, large areas of the image may be empty of primitives; rasterization will ignore these areas, but pixel-by-pixel rendering must pass through them. Second, rasterization can improve cache coherency and reduce redundant work by taking advantage of the fact that the pixels occupied by a single primitive tend to be contiguous in the image. For these reasons, rasterization is usually the approach of choice when interactive rendering is required; however, the pixel-by-pixel approach can often produce higher-quality images and is more versatile because it does not depend on as many assumptions about the image as rasterization.

The older form of rasterization is characterized by rendering an entire face (primitive) as a single color. Alternatively, rasterization can be done in a more complicated manner by first rendering the vertices of a face and then rendering the pixels of that face as a blending of the vertex colors. This version of rasterization has overtaken the old method as it allows the graphics to flow without complicated textures (a rasterized image when used face by face tends to have a very block-like effect if not covered in complex textures; the faces are not smooth because there is no gradual color change from one primitive to the next). This newer method of rasterization utilizes the graphics card's more taxing shading functions and still achieves better performance because the simpler textures stored in memory use less space. Sometimes designers will use one rasterization method on some faces and the other method on others based on the angle at which that face meets other joined faces, thus increasing speed and not hurting the overall effect.

Ray casting

Main page: Ray casting

In ray casting the geometry which has been modeled is parsed pixel by pixel, line by line, from the point of view outward, as if casting rays out from the point of view. Where an object is intersected, the color value at the point may be evaluated using several methods. In the simplest, the color value of the object at the point of intersection becomes the value of that pixel. The color may be determined from a texture-map. A more sophisticated method is to modify the color value by an illumination factor, but without calculating the relationship to a simulated light source. To reduce artifacts, a number of rays in slightly different directions may be averaged.

Ray casting involves calculating the "view direction" (from camera position), and incrementally following along that "ray cast" through "solid 3d objects" in the scene, while accumulating the resulting value from each point in 3D space. This is related and similar to "ray tracing" except that the raycast is usually not "bounced" off surfaces (where the "ray tracing" indicates that it is tracing out the lights path including bounces). "Ray casting" implies that the light ray is following a straight path (which may include traveling through semi-transparent objects). The ray cast is a vector that can originate from the camera or from the scene endpoint ("back to front", or "front to back"). Sometimes the final light value is derived from a "transfer function" and sometimes it's used directly.

Rough simulations of optical properties may be additionally employed: a simple calculation of the ray from the object to the point of view is made. Another calculation is made of the angle of incidence of light rays from the light source(s), and from these as well as the specified intensities of the light sources, the value of the pixel is calculated. Another simulation uses illumination plotted from a radiosity algorithm, or a combination of these two.

Ray tracing

Spiral Sphere and Julia, Detail, a computer-generated image created by visual artist Robert W. McGregor using only POV-Ray 3.6 and its built-in scene description language

Main page: Ray tracing (graphics)

Ray tracing aims to simulate the natural flow of light, interpreted as particles. Often, ray tracing methods are utilized to approximate the solution to the rendering equation by applying Monte Carlo methods to it. Some of the most used methods are path tracing, bidirectional path tracing, or Metropolis light transport, but also semi realistic methods are in use, like Whitted Style Ray Tracing, or hybrids. While most implementations let light propagate on straight lines, applications exist to simulate relativistic spacetime effects.^[9]

In a final, production quality rendering of a ray traced work, multiple rays are generally shot for each pixel, and traced not just to the first object of intersection, but rather, through a number of sequential 'bounces', using the known laws of optics such as "angle of incidence equals angle of reflection" and more advanced laws that deal with refraction and surface roughness.

Once the ray either encounters a light source, or more probably once a set limiting number of bounces has been evaluated, then the surface illumination at that final point is evaluated using techniques described above, and the changes along the way through the various bounces evaluated to estimate a value observed at the point of view. This is all repeated for each sample, for each pixel.

In distribution ray tracing, at each point of intersection, multiple rays may be spawned. In path tracing, however, only a single ray or none is fired at each intersection, utilizing the statistical nature of Monte Carlo experiments.

As part of the approach known as physically based rendering, path tracing has become the dominant technique for rendering realistic scenes, including effects for movies.^[10] For example, the popular open source 3D software Blender uses path tracing in its Cycles renderer.^[11] Images produced using path tracing for global illumination are generally noisier than when using radiosity (the main competing algorithm), but radiosity can be difficult to apply to complex scenes and is prone to artifacts that arise from using a tessellated representation of irradiance.^{[10][4]:975-976, 1045}

Path tracing's relative simplicity and its nature as a Monte Carlo method (sampling hundreds or thousands of paths per pixel) make it attractive to implement on a GPU, especially on recent GPUs that support ray tracing acceleration technology such as Nvidia's RTX and OptiX.^[12] Many techniques have been developed to denoise the output of path tracing, reducing the number of paths required to achieve acceptable quality, at the risk of losing some detail or introducing small-scale artifacts that are more objectionable than noise;^[13][14] neural networks are now widely used for this purpose.^[15][16][17]

Advances in GPU technology have made real-time ray tracing possible in games, although it is currently almost always used in combination with rasterization.^[6]:2 This enables visual effects that are difficult with only rasterization, including reflection from curved surfaces and interreflective objects,^[18]:305 and shadows that are accurate over a wide range of distances and surface orientations.^[1]:159-160 Ray tracing support is included in recent versions of the graphics APIs used by games, such as DirectX, Metal, and Vulkan.^[19]

Neural rendering

Neural rendering is a rendering method using artificial neural networks.^[20][21] Neural rendering includes image-based rendering methods that are used to reconstruct 3D models from 2-dimensional images.^[20]One of these methods are photogrammetry, which is a method in which a collection of images from multiple angles of an object are turned into a 3D model. There have also been recent developments in generating and rendering 3D models from text and coarse paintings by notably Nvidia, Google and various other companies.

Radiosity

Main page: Radiosity (computer graphics)

Radiosity is a method which attempts to simulate the way in which directly illuminated surfaces act as indirect light sources that illuminate other surfaces. This produces more realistic shading and seems to better capture the 'ambience' of an indoor scene. A classic example is a way that shadows 'hug' the corners of rooms.

The optical basis of the simulation is that some diffused light from a given point on a given surface is reflected in a large spectrum of directions and illuminates the area around it.

The simulation technique may vary in complexity. Many renderings have a very rough estimate of radiosity, simply illuminating an entire scene very slightly with a factor known as ambiance. However, when advanced radiosity estimation is coupled with a high quality ray tracing algorithm, images may exhibit convincing realism, particularly for indoor scenes.

In advanced radiosity simulation, recursive, finite-element algorithms 'bounce' light back and forth between surfaces in the model, until some recursion limit is reached. The colouring of one surface in this way influences the colouring of a neighbouring surface, and vice versa. The resulting values of illumination throughout the model (sometimes including for empty spaces) are stored and used as additional inputs when performing calculations in a ray-casting or ray-tracing model.

Due to the iterative/recursive nature of the technique, complex objects are particularly slow to emulate. Prior to the standardization of rapid radiosity calculation, some digital artists used a technique referred to loosely as false radiosity by darkening areas of texture maps corresponding to corners, joints and recesses, and applying them via self-illumination or diffuse mapping for scanline rendering. Even now, advanced radiosity calculations may be reserved for calculating the ambiance of the room, from the light reflecting off walls, floor and ceiling, without examining the contribution that complex objects make to the radiosity – or complex objects may be replaced in the radiosity calculation with simpler objects of similar size and texture.

Radiosity calculations are viewpoint independent which increases the computations involved, but makes them useful for all viewpoints. If there is little rearrangement of radiosity objects in the scene, the same radiosity data may be reused for a number of frames, making radiosity an effective way to improve on the flatness of ray casting, without seriously impacting the overall rendering time-per-frame.

Because of this, radiosity is a prime component of leading real-time rendering methods, and has been used from beginning-to-end to create a large number of well-known recent feature-length animated 3D-cartoon films.

Sampling and filtering

One problem that any rendering system must deal with, no matter which approach it takes, is the sampling problem. Essentially, the rendering process tries to depict a continuous function from image space to colors by using a finite number of pixels. As a consequence of the Nyquist–Shannon sampling theorem (or Kotelnikov theorem), any spatial waveform that can be displayed must consist of at least two pixels, which is proportional to image resolution. In simpler terms, this expresses the idea that an image cannot display details, peaks or troughs in color or intensity, that are smaller than one pixel.

If a naive rendering algorithm is used without any filtering, high frequencies in the image function will cause ugly aliasing to be present in the final image. Aliasing typically manifests itself as jaggies, or jagged edges on objects where the pixel grid is visible. In order to remove aliasing, all rendering algorithms (if they are to produce good-looking images) must use some kind of low-pass filter on the image function to remove high frequencies, a process called antialiasing.

Optimization

Due to the large number of calculations, a work in progress is usually only rendered in detail appropriate to the portion of the work being developed at a given time, so in the initial stages of modeling, wireframe and ray casting may be used, even where the target output is ray tracing with radiosity. It is also common to render only parts of the scene at high detail, and to remove objects that are not important to what is currently being developed.

For real-time, it is appropriate to simplify one or more common approximations, and tune to the exact parameters of the scenery in question, which is also tuned to the agreed parameters to get the most 'bang for the buck'.

Academic core

Main page: Unbiased rendering

The implementation of a realistic renderer always has some basic element of physical simulation or emulation – some computation which resembles or abstracts a real physical process.

The term "physically based" indicates the use of physical models and approximations that are more general and widely accepted outside rendering. A particular set of related techniques have gradually become established in the rendering community.

The basic concepts are moderately straightforward, but intractable to calculate; and a single elegant algorithm or approach has been elusive for more general purpose renderers. In order to meet demands of robustness, accuracy and practicality, an implementation will be a complex combination of different techniques.

Rendering research is concerned with both the adaptation of scientific models and their efficient application.

The rendering equation

Main page: Rendering equation

This is the key academic/theoretical concept in rendering. It serves as the most abstract formal expression of the non-perceptual aspect of rendering. All more complete algorithms can be seen as solutions to particular formulations of this equation.

[math]\displaystyle{ L_o(x, \omega) = L_e(x, \omega) + \int_\Omega L_i(x, \omega') f_r(x, \omega', \omega) (\omega' \cdot n) \, \mathrm d \omega' }[/math]

Meaning: at a particular position and direction, the outgoing light (L_o) is the sum of the emitted light (L_e) and the reflected light. The reflected light being the sum of the incoming light (L_i) from all directions, multiplied by the surface reflection and incoming angle. By connecting outward light to inward light, via an interaction point, this equation stands for the whole 'light transport' – all the movement of light – in a scene.

The bidirectional reflectance distribution function

The bidirectional reflectance distribution function (BRDF) expresses a simple model of light interaction with a surface as follows:

[math]\displaystyle{ f_r(x, \omega', \omega) = \frac{\mathrm d L_r(x, \omega)}{L_i(x, \omega')(\omega' \cdot \vec n) \mathrm d \omega'} }[/math]

Light interaction is often approximated by the even simpler models: diffuse reflection and specular reflection, although both can ALSO be BRDFs.

Geometric optics

Rendering is practically exclusively concerned with the particle aspect of light physics – known as geometrical optics. Treating light, at its basic level, as particles bouncing around is a simplification, but appropriate: the wave aspects of light are negligible in most scenes, and are significantly more difficult to simulate. Notable wave aspect phenomena include diffraction (as seen in the colours of CDs and DVDs) and polarisation (as seen in LCDs). Both types of effect, if needed, are made by appearance-oriented adjustment of the reflection model.

Visual perception

Though it receives less attention, an understanding of human visual perception is valuable to rendering. This is mainly because image displays and human perception have restricted ranges. A renderer can simulate a wide range of light brightness and color, but current displays – movie screen, computer monitor, etc. – cannot handle so much, and something must be discarded or compressed. Human perception also has limits, and so does not need to be given large-range images to create realism. This can help solve the problem of fitting images into displays, and, furthermore, suggest what short-cuts could be used in the rendering simulation, since certain subtleties will not be noticeable. This related subject is tone mapping.

Mathematics used in rendering includes: linear algebra, calculus, numerical mathematics, signal processing, and Monte Carlo methods.

Rendering for movies often takes place on a network of tightly connected computers known as a render farm.

The current^[when?] state of the art in 3-D image description for movie creation is the Mental Ray scene description language designed at Mental Images and RenderMan Shading Language designed at Pixar^[22] (compare with simpler 3D fileformats such as VRML or APIs such as OpenGL and DirectX tailored for 3D hardware accelerators).

Other renderers (including proprietary ones) can and are sometimes used, but most other renderers tend to miss one or more of the often needed features like good texture filtering, texture caching, programmable shaders, highend geometry types like hair, subdivision or nurbs surfaces with tesselation on demand, geometry caching, raytracing with geometry caching, high quality shadow mapping, speed or patent-free implementations. Other highly sought features these days may include interactive photorealistic rendering (IPR) and hardware rendering/shading.

Chronology of important published ideas

Rendering of an ESTCube-1 satellite

• 1968 Ray casting^[23]
• 1970 Scanline rendering^[24]
• 1971 Gouraud shading^[25]
• 1973 Phong shading^[26][27]
• 1973 Phong reflection^[26]
• 1973 Diffuse reflection^[28]
• 1973 Specular highlight^[26]
• 1973 Specular reflection^[26]
• 1974 Sprites^[29]
• 1974 Scrolling^[29]
• 1974 Texture mapping^[30]
• 1974 Z-buffering^[30]
• 1976 Environment mapping^[31]
• 1977 Blinn shading^[32]
• 1977 Side-scrolling^[33]
• 1977 Shadow volumes^[34]
• 1978 Shadow mapping^[35]
• 1978 Bump mapping^[36]
• 1979 Tile map^[37]
• 1980 BSP trees^[38]
• 1980 Ray tracing^[39]
• 1981 Parallax scrolling^[40]
• 1981 Sprite zooming^[41]
• 1981 Cook shader^[42]
• 1983 MIP maps^[43]
• 1984 Octree ray tracing^[44]
• 1984 Alpha compositing^[45]
• 1984 Distributed ray tracing^[46]
• 1984 Radiosity^[47]
• 1985 Row/column scrolling^[48]
• 1985 Hemicube radiosity^[49]
• 1986 Light source tracing^[50]
• 1986 Rendering equation^[51]
• 1987 Reyes rendering^[52]
• 1988 Depth cue^[53]
• 1988 Distance fog^[53]
• 1988 Tiled rendering^[53]
• 1991 Xiaolin Wu line anti-aliasing^[54][55]
• 1991 Hierarchical radiosity^[56]
• 1993 Texture filtering^[57]
• 1993 Perspective correction^[58]
• 1993 Transform, clipping, and lighting^[59]
• 1993 Directional lighting^[59]
• 1993 Trilinear interpolation^[59]
• 1993 Z-culling^[59]
• 1993 Oren–Nayar reflectance^[60]
• 1993 Tone mapping^[61]
• 1993 Subsurface scattering^[62]
• 1994 Ambient occlusion^[63]
• 1995 Hidden-surface determination^[64]
• 1995 Photon mapping^[65]
• 1996 Multisample anti-aliasing^[66]
• 1997 Metropolis light transport^[67]
• 1997 Instant Radiosity^[68]
• 1998 Hidden-surface removal^[69]
• 2000 Pose space deformation^[70]
• 2002 Precomputed Radiance Transfer^[71]

See also

• 2D computer graphics – Computer-based generation of digital images
• 3D computer graphics – Graphics that use a three-dimensional representation of geometric data
• 3D rendering – Process of converting 3D scenes into 2D images
• Artistic rendering
• Architectural rendering
• Physics:Chromatic aberration – Failure of a lens to focus all colors on the same point
• Displacement mapping – Computer graphics technique
• Font rasterization – Process of converting text from vector to raster
• Global illumination – Group of rendering algorithms used in 3D computer graphics
• Graphics pipeline – Procedure to convert 3D scenes to 2D images
• Heightmap – Type of raster image in computer graphics
• High-dynamic-range rendering – Rendering of computer graphics scenes by using lighting calculations done in high-dynamic-range
• Image-based modeling and rendering
• Motion blur – Photography artifact from moving objects
• Non-photorealistic rendering – Style of rendering
• Normal mapping – Texture mapping technique
• Painter's algorithm – Algorithm for visible surface determination in 3D graphics
• Per-pixel lighting
• Physically based rendering – Computer graphics technique
• Pre-rendering
• Raster image processor
• Radiosity – Computer graphics rendering method using diffuse reflection
• Ray tracing – Rendering method
• Real-time computer graphics – Sub-field of computer graphics
• Reyes – Computer software architecture in 3D computer graphics
• Scanline rendering/Scanline algorithm – 3D computer graphics image rendering method
• Software rendering – Generating images by computer software
• Sprite (computer graphics) – 2D bitmap displayed on top of a larger scene
• Unbiased rendering – Type of rendering in computer graphics
• Vector graphics – Computer graphics images defined by points, lines and curves
• Software:VirtualGL
• Virtual studio
• Volume rendering – Representing a 3D-modeled object or dataset as a 2D projection
• Z-buffer algorithms – Type of data buffer in computer graphics

References

Further reading

• Akenine-Möller, Tomas; Haines, Eric; Hoffman, Naty; Pesce, Angelo; Iwanicki, Micał; Hillaire, Sébastien (2018). Real-time rendering (4 ed.). Boca Raton, FL, USA.: AK Peters. ISBN 978-1-13862-700-0. https://www.realtimerendering.com/. 
• Blinn, Jim (1996). Jim Blinn's corner : a trip down the graphics pipeline. San Francisco, Calif.: Morgan Kaufmann Publishers. ISBN 978-1-55860-387-5. 
• Cohen, Michael F.; Wallace, John R. (1998). Radiosity and realistic image synthesis (3 ed.). Boston, Mass. [u.a.]: Academic Press Professional. ISBN 978-0-12-178270-2. 
• Philip Dutré; Bekaert, Philippe; Bala, Kavita (2003). Advanced global illumination ([Online-Ausg.] ed.). Natick, Mass.: A K Peters. ISBN 978-1-56881-177-2. 
• Foley, James D.; Van Dam; Feiner; Hughes (1990). Computer graphics : principles and practice (2 ed.). Reading, Mass.: Addison-Wesley. ISBN 978-0-201-12110-0. https://archive.org/details/computergraphics00fole. 
• Andrew S. Glassner, ed (1989). An introduction to ray tracing (3 ed.). London [u.a.]: Acad. Press. ISBN 978-0-12-286160-4. 
• Glassner, Andrew S. (2004). Principles of digital image synthesis (2 ed.). San Francisco, Calif.: Kaufmann. ISBN 978-1-55860-276-2. 
• Gooch, Bruce; Gooch, Amy (2001). Non-photorealistic rendering. Natick, Mass.: A K Peters. ISBN 978-1-56881-133-8. 
• Jensen, Henrik Wann (2001). Realistic image synthesis using photon mapping ([Nachdr.] ed.). Natick, Mass.: AK Peters. ISBN 978-1-56881-147-5. 
• Pharr, Matt; Humphreys, Greg (2004). Physically based rendering from theory to implementation. Amsterdam: Elsevier/Morgan Kaufmann. ISBN 978-0-12-553180-1. 
• Shirley, Peter; Morley, R. Keith (2003). Realistic ray tracing (2 ed.). Natick, Mass.: AK Peters. ISBN 978-1-56881-198-7. 
• Strothotte, Thomas; Schlechtweg, Stefan (2002). Non-photorealistic computer graphics modeling, rendering, and animation (2 ed.). San Francisco, CA: Morgan Kaufmann. ISBN 978-1-55860-787-3. 
• Ward, Gregory J. (July 1994). "The RADIANCE lighting simulation and rendering system". Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94. pp. 459–72. doi:10.1145/192161.192286. ISBN 0897916670. http://radsite.lbl.gov/radiance/papers/sg94.1/. 

External links

• GPU Rendering Magazine, online CGI magazine about advantages of GPU rendering
• SIGGRAPH – the ACMs special interest group in graphics – the largest academic and professional association and conference
• List of links to (recent, as of 2004) siggraph papers (and some others) on the web

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Rendering (computer graphics). Read more