Patent application number | Description | Published |
20090237400 | EFFICIENT GEOMETRIC TESSELLATION AND DISPLACEMENT - Methods and computer-storage media are provided for rendering three-dimensional (3D) graphics by tessellating objects using novel structures and algorithms. Rendering utilizing “patches,” configurable functions that include a specified number of control points, allows for computation on a per-patch or per-control-point basis, in addition to traditional per-vertex, per-primitive, and per-pixel methods. This produces a number of advantages over previous tessellation methods, including the reuse of computations across existing vertices and the ability to process at a lower frequency. The operations to compute points are simplified in order to optimize system resources used in the process. Transitions from un-tessellated to tessellated objects are smoother utilizing the present invention, while developers have more flexibility in the level of detail present at different edges of the same patch. Detail within a displacement map also can be increased without negative effects associated with previous systems and methods. | 09-24-2009 |
20110148877 | EFFICIENT GEOMETRIC TESSELLATION AND DISPLACEMENT - Methods and computer-storage media are provided for rendering three-dimensional (3D) graphics by tessellating objects using novel structures and algorithms. Rendering utilizing “patches,” configurable functions that include a specified number of control points, allows for computation on a per-patch or per-control-point basis, in addition to traditional per-vertex, per-primitive, and per-pixel methods. This produces a number of advantages over previous tessellation methods, including the reuse of computations across existing vertices and the ability to process at a lower frequency. The operations to compute points are simplified in order to optimize system resources used in the process. Transitions from un-tessellated to tessellated objects are smoother utilizing the present invention, while developers have more flexibility in the level of detail present at different edges of the same patch. Detail within a displacement map also can be increased without negative effects associated with previous systems and methods. | 06-23-2011 |
20120086715 | TARGET INDEPENDENT RASTERIZATION - Methods, systems, and computer-storage media for target independent rasterization of an image. The target is the memory allocated for a rendered image within a graphics pipeline. Embodiments of the present invention allow the rasterization process's sampling rate to be specified independently from the memory allocated for the rendered image. Embodiments of the present invention also allow the rasterization process to be executed at a rate that does not correspond to the memory allocated for the rendered target. | 04-12-2012 |
20130063473 | SYSTEM AND METHOD FOR LAYERING USING TILE-BASED RENDERERS - A method for tile-based rendering of content. Content may be rendered in a memory region organized as multiple tiles. In scenarios in which content is generated in layers, for operations that involve compositing image layers, an order in which portions of the image are processed may be selected to reduce the aggregate number of memory accesses times, which in turn may improve the performance of a computer that uses tile-based rendering. An image may be processed such that operations relating to rendering portions of different layers corresponding to the same tile are performed sequentially. Such processing may be used in a computer with a graphics processing unit that supports tile-based rendering, and may be particularly well suited for computers with a slate form factor. An interface to a graphics processing utility within the computer may provide a flag to allow an application to specify whether operations may be reordered. | 03-14-2013 |
20140368523 | HARDWARE-ACCELERATED RESOURCE TILING - In one embodiment, a graphics processing unit | 12-18-2014 |
20150091931 | Procedurally Defined Texture Maps - A procedural texture relates texel coordinates to color values through an arbitrary function, herein called a texel shader. The procedural texture is defined by a dimension, size, texel format and the texel shader. Texel coordinates are an input to the texel shader, which generates a color value for those texel coordinates. A renderer can be implemented either in hardware, such as part of a graphics processor, or in software as a computer program executed by a processor. The renderer samples from the procedural texture in response to texel coordinates, and evaluates the texel shader on demand. Filtering also can be applied automatically to results. The results of the texel shader invocations are stored in a texture cache to take advantage of spatial and temporal locality. Results are shared among threads, processes and the like through the texture cache. | 04-02-2015 |
20150269767 | CONFIGURING RESOURCES USED BY A GRAPHICS PROCESSING UNIT - A resource used by a shader executed by a graphics processing unit is referenced using a “descriptor”. Descriptors are grouped together in memory called a descriptor heap. Applications allocate and store descriptors in descriptor heaps. Applications also create one or more descriptor tables specifying a subrange of a descriptor heap. To bind resources to a shader, descriptors are first loaded into a descriptor heap. When the resources are to be used by a set of executing shaders, descriptor tables are defined on the GPU identifying ranges within the descriptor heap. Shaders, when executing, refer to the currently defined descriptor tables to access the resources made available to them. If the shader is to be executed again with different resources, and if those resources are already in memory and specified in the descriptor heap, then the descriptor tables are changed to specify different ranges of the descriptor heap. | 09-24-2015 |
20160071230 | CONFIGURING RESOURCES USED BY A GRAPHICS PROCESSING UNIT - The application programming interface permits an application to specify resources to be used by shaders, executed by the GPU, through a data structure called the “root arguments.” A root signature is a data structure in an application that defines the layout of the root arguments used by an application. The root arguments are a data structure resulting from the application populating locations in memory according to the root signature. The root arguments can include one or more constant values or other state information, and/or one or more pointers to memory locations which can contain descriptors, and/or one or more descriptor tables. Thus, the root arguments can support multiple levels of indirection through which a GPU can identify resources that are available for shaders to access. | 03-10-2016 |
20160071315 | Convex Polygon Clipping During Rendering - In one example, a graphic computing device may apply a clipping technique to accurately and efficiently render a graphic data set. A central processing unit may generate a convex polygonal clip from a two-dimensional polygon. The central processing unit may calculate a clipping plane for a convex polygonal clip based on an edge of the convex polygonal clip. A graphics processor may apply the convex polygonal clip in a pixel shader. | 03-10-2016 |