Abstract: Real-time light field reconstruction for defocus blur may be used to handle the case of simultaneous defocus and motion blur. By carefully introducing a few approximations, a very efficient sheared reconstruction filter is derived, which produces high quality images even for a very low number of input samples in some embodiments. The algorithm may be temporally robust, and is about two orders of magnitude faster than previous work, making it suitable for both real-time rendering and as a post-processing pass for high quality rendering in some embodiments.

Abstract: Real-time light field reconstruction for defocus blur may be used to handle the case of simultaneous defocus and motion blur. By carefully introducing a few approximations, a very efficient sheared reconstruction filter is derived, which produces high quality images even for a very low number of input samples in some embodiments. The algorithm may be temporally robust, and is about two orders of magnitude faster than previous work, making it suitable for both real-time rendering and as a post-processing pass for high quality rendering in some embodiments.

Abstract: An algorithm may reconstruct defocus blur from a sparsely sampled light field. Light field samples are generated, using stochastic rasterization or ray tracing as examples. Then the samples are partitioned into depth layers. These depth layers are filtered independently and then combined together, taking into account inter-layer visibility. Since each layer corresponds to a smaller depth range, it results in more effective reconstruction filters than previous approaches.

Abstract: A shading rate may be set by analyzing samples within a pixel. Then based on that analysis, a system determines whether to use coarse pixel, pixel or sample shading for a region of pixels. Based on the determined type of shading, the shading rate may be set.

Abstract: Representing a transparent object as a summation of substantially zero step functions of a visibility curve for the object. An array may be used to store nodes to represent the visibility function. The size of the array may be limited to be storable within a memory of an on-chip graphics processing unit.

Abstract: A system, method, and computer program product are provided for performing object-space shading. A primitive defined by vertices in three-dimensional (3D) space that is specific to an object defined by at least the primitive is received and a shading sample rate is computed for the primitive based on a screen-space derivative of coordinates of a pixel fragment transformed into the 3D space. A shader program is executed by a processing pipeline to compute shaded attributes for the primitive according to the computed shading sample rate.

Abstract: A system, method, and computer program product are provided fir shading using a dynamic object-space grid. An object defined by triangle primitives in a three-dimensional (3D) space that is specific to the object is received and an object-space shading grid is defined for a first triangle primitive of the triangle primitives based on coordinates of the first triangle primitive in the 3D space. A shader program is executed by a processing pipeline to compute a shaded value at a point on the object-space shading grid for the first triangle primitive.

Abstract: An apparatus and method for performing coarse pixel shading (CPS). For example, one embodiment of a method comprises: A method for coarse pixel shading (CPS) comprising: pre-processing a graphics mesh by creating a tangent-plane parameterization of desired vertex attributes for each vertex of the mesh; and performing rasterization of the mesh in a rasterization stage of a graphics pipeline using the tangent-plane parameterization.

Abstract: Various embodiments are generally directed to techniques for reducing processing demands of shading primitives in rendering a 2D screen image from a 3D model. A device includes a clipping component to clip a visible primitive of a 2D screen image derived from of a 3D model within a first area of the screen image covered by a shading pixel to form a polygon representing an intersection of the first area and the visible primitive; a first interpolation component to interpolate at least one attribute of vertices of the visible primitive to each vertex of the polygon; and a second interpolation component to interpolate color values of the vertices of the polygon to a point within a second area covered by a screen pixel of the screen image, the second area smaller than the first area and at least partly coinciding with the first area. Other embodiments are described and claimed.

Abstract: A method and system for producing an image to be displayed are disclosed herein. The image includes a plurality of pixels. An example of the method includes dedicating a fixed amount of memory to store a data structure for a pixel of plurality of pixels. The method also includes building a visibility function and determining a partial color sum for each fragment of the plurality of fragments. A pixel color is determined using the visibility function and the partial color sums.

Abstract: Systems and methods may provide for receiving fragment data for a pixel of an image at a deferred shader stage of a rendering pipeline and identifying one or more surfaces in the pixel based on the fragment data. Additionally, each identified surface may be stored as an entry in a geometry buffer (G-buffer) corresponding to the pixel if a memory overflow condition for the G-buffer is not met. In one example, a weight is assigned to each surface in the G-buffer based on a coverage of the pixel by the surface and an occlusion status of the surface, and a color is resolved for the pixel based on the assigned weights.

Abstract: Shadow map partitions may be automatically placed based on the location or concentration of sample data depth in eye space. An initial positioning for the partitions may be determined based on user specified budgets for number of partitions, computation time, or memory utilization, in some embodiments. The initial positioning may be refined using a clustering algorithm in some cases.

Abstract: Real-time light field reconstruction for defocus blur may be used to handle the case of simultaneous defocus and motion blur. By carefully introducing a few approximations, a very efficient sheared reconstruction filter is derived, which produces high quality images even for a very low number of input samples in some embodiments. The algorithm may be temporally robust, and is about two orders of magnitude faster than previous work, making it suitable for both real-time rendering and as a post-processing pass for high quality rendering in some embodiments.

Abstract: In some embodiments, a given frame or picture may have different shading rates. In one embodiment in some areas of the frame or picture the shading rate may be less than once per pixel and in other places it may be once per pixel. An algorithm may be used to determine how the shading rate changes across the frame.

Abstract: In some embodiments, a given frame or picture may have different shading rates. In one embodiment in some areas of the frame or picture the shading rate may be less than once per pixel and in other places it may be once per pixel. Examples where the shading rate may be reduced include areas where there is motion and camera defocus, areas of peripheral blur, and in general, any case where the visibility is reduced anyway. The shading rate may be changed in a region, such as a shading quad, by changing the size of the region.

Abstract: Methods and systems may provide for obtaining a plurality of visibility samples for an image at a sample resolution, wherein a first subset of the plurality of visibility samples has corresponding color samples. One or more of the color samples may be replicated from the first subset to a second subset of the plurality of visibility samples, and the visibility samples and the color samples may be rendered at a native display resolution. Additionally, the sample resolution may be greater than a pixel resolution of the image and greater than or equal to the native display resolution. In one example, the image includes a plurality of pixels and the plurality of visibility samples are obtained in accordance with an axis-aligned grid within each pixel of the image.

Abstract: A dynamic volumetric medium, such as hair, fog, or smoke, may be represented, for purposes of shadow mapping, by transmittance versus depth data for that medium. In one embodiment, the representation may take the form of a plot of transmittance versus depth, with nodes where the transmittance changes non-live linearly with respect of depth into the medium. The number of nodes in the representation may be reduced to reduce memory footprint and to enable the storage of the representation on the same chip doing the shadow mapping. In some embodiments, the number of nodes may be reduced, one node at a time, by removing the node whose underlying trapezoid has the least area of all the remaining nodes.

Abstract: An algorithm may reconstruct defocus blur from a sparsely sampled light field. Light field samples are generated, using stochastic rasterization or ray tracing as examples. Then the samples are partitioned into depth layers. These depth layers are filtered independently and then combined together, taking into account inter-layer visibility. Since each layer corresponds to a smaller depth range, it results in more effective reconstruction filters than previous approaches.

Abstract: Methods and systems may provide for identifying a plurality of subject commands that reference a common screen location and access a read/write resource, and serializing the plurality of subject commands according to a predefined order. Additionally, execution of the plurality of subject commands may be deferred until one or more additional commands referencing the common screen location are executed. In one example, the plurality of subject commands are serialized in response to a serialization command.

Abstract: In some cases, instead of providing one color sample for every primitive overlying a pixel, surfaces made up of more than one primitive may be identified. In some cases, a surface may be identified that is likely to be of the same color. So, in such case, only one color sample may be needed for more than one primitive.