Abstract: A system, method, and computer program product are provided for generating a plurality of two-dimensional images and a plurality of depth maps for a scene at a point in time. In various embodiments, such two-dimensional images and depth maps may be utilized to generate a plurality of images.
Type:
Grant
Filed:
June 19, 2007
Date of Patent:
October 15, 2013
Assignee:
NVIDA Corporation
Inventors:
David Robert Cook, Gerrit A. Slavenburg, Viatcheslav V. Gostrenko
Abstract: A system, method, and computer program product are provided for focusing computing power to a region of interest that can be changed interactively and arbitrarily during the process of image synthesis. In operation, a problem domain is partitioned utilizing a first selected technique. Additionally, a number of samples to be drawn per partition are assigned utilizing a second selected technique. Furthermore, the assigned number of samples are drawn for each partition, where the samples are generated by only one deterministic sample sequence. Still yet, the partitioning, assigning, and drawing are capable of being repeated such that existing partitions and assignments are capable of remaining unchanged during sampling and a convergence speed is adapted without compromising convergence in at least one of a sequential computing environment or a parallel computing environment. In this way, the convergence of image synthesis is not compromised.
Type:
Grant
Filed:
July 30, 2009
Date of Patent:
October 15, 2013
Assignee:
NVIDA Corporation
Inventors:
Alexander Keller, Carsten A. Wächter, Michael R. Kaplan
Abstract: A vertex cache within a graphics processor is configured to operate as a conventional round-robin streaming cache when per-vertex state changes are not used and is configured to operate as a random access storage buffer when per-vertex state changes are used. Batches of vertices that define primitives and state changes are output to parallel processing units for processing according to vertex shader program. In addition to allowing per-vertex state changes, the vertex cache is configured to store vertices for primitive topologies that use anchor points, such as triangle strips, line loops, and polygons.
Type:
Grant
Filed:
November 5, 2007
Date of Patent:
August 7, 2012
Assignee:
NVIDA Corporation
Inventors:
James C. Bowman, Dane T. Mrazek, Sameer M. Gauria
Abstract: A method for transparently directing data in a multi-GPU system. A driver application receives a first plurality of graphics commands from a first graphics application and selects a first GPU from the multi-GPU system to exclusively process the first plurality of graphics commands. The first plurality of graphics commands is transmitted to the first GPU for processing and producing a first plurality of renderable data. The first plurality of renderable data is stored in a first frame buffer associated with the first GPU. A second plurality of graphics commands is received from a second graphics application and a second GPU is selected to exclusively process the second plurality of graphics commands. The second GPU processing the second plurality of graphics commands produces a second plurality of renderable data. The second plurality of renderable data is stored in a second frame buffer associated with the second GPU.
Abstract: Clipping techniques introduce additional vertices into existing primitives without requiring creation of new primitives. For an input triangle with one vertex on the invisible side of a clipping surface, a quadrangle can be defined. The vertices of the quadrangle are the two internal vertices of the input triangle and two clipped vertices. For determining attribute values for pixel shading, three vertices of the quadrangle are selected, and a parameter value for an attribute equation is computed using the three selected vertices. For determining pixel coverage for the quadrangle, the three edges that do not correspond to the edge created by clipping are used.
Type:
Grant
Filed:
August 11, 2004
Date of Patent:
November 6, 2007
Assignee:
NVIDA Corporation
Inventors:
Craig M. Wittenbrink, Henry Packard Moreton, Douglas A. Voorhies, John S. Montrym, Vimal S. Parikh