Telefonaktiebolaget Lm Ericsson (publ)

Intel Corporation

Nvidia Corporation

Tomas Guy Akenine-Möller

Jacob Ström

Jon N Hasselgren

Jacob J Munkberg

Carl Jacob Munkberg

Robert M Toth

Jim K Nilsson

Franz Petrik Clarberg

Jim Rasmusson

Johan Pontus Andersson

Petrik Clarberg

Marco Salvi

Magnus Andersson

Rasmus Barringer

Carl Johan Gribel

Per Wennersten

Aaron Eliot Lefohn

Josef Bo Spjut

Bjorn Johnsson

Michael Doggett

Erik Ledfelt

Jim Kjell David Nilsson

Björn Johnsson

Matt Pharr

Jakob Ström

Fredrik Tolf

Martin Levin

A ray tracing method forms a first accumulation of importance values of non-clamped pixels in an image and forms a second accumulation of waste importance of clamped pixels in the image. The first accumulation and the second accumulation are applied to set an updated average sample count for pixels in the image, and the ray tracer generates a number of sampling rays for particular pixels by applying the updated average sample count to a per-pixel importance setting.

Average rate regulator for parallel adaptive sampler

A method dynamically selects one of a first sampling order and a second sampling order for a ray trace of pixels in a tile where the selection is based on a motion vector for the tile. The sampling order may be a bowtie pattern or an hourglass pattern.

Adaptive pixel sampling order for temporally dense rendering

Image quality can be improved by rendering the image based on an importance map that indicates regions of the image that will benefit from more samples. Adaptive sampling determines a number of samples for each pixel of the image using a target sampling rate and the importance map for the image. The number of samples for each pixel needs to be a non-negative integer value, so the per-pixel sampling rates are quantized using per-pixel random values. The resulting quantized sampling rates provides a distribution of samples that closely matches the importance map. The per-pixel random values may vary over time so that the average of the distribution more closely matches the importance map.

Adaptive sampling at a target sampling rate

A method dynamically selects one of a first sampling order and a second sampling order for a ray trace of pixels in a tile where the selection is based on a motion vector for the tile. The sampling order may be a bowtie pattern or an hourglass pattern. Subframes generated based on the sampling order are communicated over a bus along with motion vectors for tiles of the subframes.

Reconstruction for temporally dense ray trace rendering

A unified compression/decompression architecture is disclosed for reducing memory bandwidth requirements in 3D graphics processing applications. The techniques described erase several distinctions between a texture (compressed once, and decompressed many times), and buffers (compressed and decompressed repeatedly during rendering of an image). An exemplary method for processing graphics data according to one or more embodiments of the invention thus begins with the updating of one or more tiles of a first image array, which are then compressed, using a real-time buffer compression algorithm, to obtain compressed image array tiles. The compressed image array tiles are stored for subsequent use as a texture. During real-time rendering of a second image array, the compressed image array tiles are retrieved and decompressed using a decompression algorithm corresponding to the buffer compression algorithm. The decompressed image array tiles are then applied as a texture to one or more primitives in the second image array.

Unified compression/decompression graphics architecture

A mechanism is described for facilitating environment-based lossy compression of data for efficient rendering of contents at computing devices. A method of embodiments, as described herein, includes collecting, in real time, sensory input data relating to characteristics of at least one of a user and a surrounding environment. The method may further include evaluating the sensory input data to mark one or more data portions of data relating to contents, where the one or more data portions are determined to be suitable for compression based on the sensory input data. The method may further include dynamically performing, in real time, the compression of the one or more data portions, where the compression triggers loss of one or more content portions of the contents corresponding to the one or more data portions of the data. The method may further include rendering the contents to be displayed missing the one or more content portions, where the missing of the one or more content portions from the contents is not apparent to the user viewing the contents via a display device.

Facilitating environment-based lossy compression of data for efficient rendering of contents at computing devices

Micropolygon splatting may involve tessellating by subdividing a mesh until triangle edges are shorter than 0.75 pixels. In some cases, rasterizing the primitive may be avoided.

Micropolygon splatting

Multi-view rasterization may be performed by calculating visibility over a camera line. Edge equations may be evaluated iteratively along a scanline. The edge equations may be evaluated using single instruction multiple data instruction sets.

Multi-view rasterization using an analyticl visibility function

A rasterizer, based on time-dependent edge equations, computes analytical visibility in order to render accurate motion blur. An oracle-based compression algorithm for the time intervals lowers the frame buffer requirements. High quality motion blurred scenes can be rendered using a rasterizer with rather low memory requirements. The resulting images may contain motion blur for both opaque and transparent objects.

Analytical motion blur rasterization with compression

Depth of field may be rasterized by culling half-space regions on a lens from which a triangle to be rendered is not visible. Then, inside tests are only performed on the remaining unculled half-space regions. Separating planes between the triangle to be rendered and the tile being processed can be used to define the half-space regions.

Depth of field rasterization by culling regions on a lens from which a convex polygon to be rendered is not visible

A standard occlusion query (OQ) may be generalized to five dimensions, which can be used for motion blurred, defocused, occlusion culling. As such, the occlusion query concept is generalized so that it can be used within 5D rasterization, which is used for rendering of motion blur and depth of field. For 5D rasterization, occlusion culling may be done with OQs as well, applied to solve other rendering related problems.

Five-dimensional occlusion queries

Motion blur rasterization may involve executing a first test for each plane of a tile frustum. The first test is a frustum plane versus moving bounding box overlap test where planes bounding a moving primitive are overlap tested against a screen tile frustum. According to a second test executed after the first test, for primitive edges against tile corners, the second test is a tile corner versus moving edge overlap test. The corners of the screen space tile are tested against a moving triangle edge in two-dimensional homogeneous space.

Hierarchical motion blur rasterization

A single instruction multiple data (SIMD) processor with a given width may operate on registers of the same width completely filled with fragments. A parallel set of registers are loaded and tested. The fragments that fail are eliminated and the register set is refilled from the parallel set.

Growing community of inventors

Lund, Sweden

Tomas Guy Akenine-Möller