Douglas Edward Rogers

US Patent:

7605820, Oct 20, 2009

Filed:

Sep 15, 2005

Appl. No.:

11/227551

Inventors:

Douglas H. Rogers - Gilroy CA, US
Kevin Bjorke - Santa Clara CA, US

Assignee:

NVIDIA Corporation - Santa Clara CA

International Classification:

G09G 5/00
G06T 17/20
G06T 17/00

US Classification:

345582, 345419, 345420, 345421, 345423, 345619, 345621, 345623

Abstract:

Discontinuities along texture mapped seams of three-dimensional models may be reduced by creating and sampling texture data outside of chart boundaries. When a texel center is not within a chart boundary (a group of connected triangles in texture space) a phantom face is generated that includes the texel center. Phantom texture coordinates are created for each texel center that is covered by the phantom face. The phantom texture coordinates are used to read a texture sample from another chart in texture space that is adjacent to the chart boundary in model space, producing a smooth transition across the seam.

US Patent:

7961195, Jun 14, 2011

Filed:

Nov 16, 2004

Appl. No.:

10/990900

Inventors:

Douglas H. Rogers - Gilroy CA, US
Gary C. King - San Jose CA, US
Walter E. Donovan - Saratoga CA, US

Assignee:

Nvidia Corporation - Santa Clara CA

International Classification:

G06T 9/00
G06F 15/00
G06T 1/00

US Classification:

345555, 345501

Abstract:

Methods and systems for compressing and decompressing data are described. A first value of N+1 bits and a second value of N+1 bits are reduced to strings of N bits each. The first and second strings of N bits are stored in a particular order relative to one another in a compression block. The particular order in which the first and second strings of N bits are stored in the compression block is used to derive a bit value that is then used in combination with one of the strings of N bits to reconstruct that string as N+1 bits.

US Patent:

8078656, Dec 13, 2011

Filed:

Nov 16, 2004

Appl. No.:

10/990884

Inventors:

Douglas H. Rogers - Gilroy CA, US
Gary C. King - San Jose CA, US
Walter E. Donovan - Saratoga CA, US

Assignee:

NVIDIA Corporation - Santa Clara CA

International Classification:

G06F 15/00

US Classification:

708200

Abstract:

Methods and systems for decompressing data are described. The relative magnitudes of a first value and a second value are compared. The first value and the second value represent respective endpoints of a range of values. The first value and the second value each have N bits of precision. Either the first or second value is selected, based on the result of the comparison. The selected value is scaled to produce a third value having N+1 bits of precision. A specified bit value is appended as the least significant bit of the other (non-selected) value to produce a fourth value having N+1 bits of precision.

US Patent:

8542243, Sep 24, 2013

Filed:

Nov 19, 2010

Appl. No.:

12/950019

Inventors:

Douglas H. Rogers - Gilroy CA, US

International Classification:

G09G 5/00

US Classification:

345582, 345423, 345552, 345555, 382232

Abstract:

Embodiments provide texture compression with high compression ratios and low decompression times. Some embodiments partition a texture map into texel blocks. The number of blocks is reduced until a compression threshold is reached, and the resulting blocks are stored as a codebook. An index array is generated by associating each texel block with an index and associating each index with the block in the codebook identified as a closest match to the associated texel block. The codebook may then be compressed according to a technique compatible with a GPU. In certain embodiments, to render a scene, a CPU “inflates” the texture map by copying the appropriate codebook block to each indexed block location of the texture map, as defined by the index array. Because the codebook blocks are already compressed in a format compatible with the GPU, the inflated texture map is also compatible with the GPU without further processing.

US Patent:

20120084334, Apr 5, 2012

Filed:

Dec 13, 2011

Appl. No.:

13/324971

Inventors:

Douglas H. Rogers - Gilroy CA, US
Gary C. King - San Jose CA, US
Walter E. Donovan - Saratoga CA, US

Assignee:

NVIDIA CORPORATION - Santa Clara CA

International Classification:

G06F 17/10

US Classification:

708203

Abstract:

Methods and systems for decompressing data are described. The relative magnitudes of a first value and a second value are compared. The first value and the second value represent respective endpoints of a range of values. The first value and the second value each have N bits of precision. Either the first or second value is selected, based on the result of the comparison. The selected value is scaled to produce a third value having N+1 bits of precision. A specified bit value is appended as the least significant bit of the other (non-selected) value to produce a fourth value having N+1 bits of precision.

US Patent:

20170091992, Mar 30, 2017

Filed:

Jan 5, 2016

Appl. No.:

14/988480

Inventors:

Douglas Rogers - Gilroy CA, US

International Classification:

G06T 17/00
G06T 17/20

Abstract:

Embodiments use hierarchical continuous level of detail (H-CLOD) trees with inherited splitting plane partitioning to reduce visual artifacts in renderings. For example, a three-dimensional mesh can be iteratively split, according to iteratively defined splitting planes, until sub-meshes are smaller than a predetermined bucket size. Each splitting can define a hierarchical level of a tree, so that the original mesh is a root node, each split sub-mesh is a child node, and the smallest meshes are leaf nodes. An H-CLOD tree can be generated by simplifying and combining each group of sibling node sub-meshes bottom-up into a simplified parent mesh accounting for inherited splitting planes, so that the tree has a most simplified mesh as its root node and a most un-simplified mesh formed by a combination of its leaf nodes. At render time, traversing the H-CLOD tree can produce a desired level of detail from the pre-computed nodes.