The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 28, 2017

Filed:

Jan. 05, 2015
Applicant:

Nvidia Corporation, Santa Clara, CA (US);

Inventors:

Samuli Matias Laine, Vantaa, FI;

Timo Oskari Aila, Tuusula, FI;

Tero Tapani Karras, Helsinki, FI;

Assignee:

NIVIDIA Corporation, Santa Clara, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06T 15/10 (2011.01); G06T 15/08 (2011.01); G06F 17/30 (2006.01); G06T 15/00 (2011.01); G06T 15/06 (2011.01); G06T 15/80 (2011.01); H04N 19/174 (2014.01); H04N 19/44 (2014.01); G06T 1/60 (2006.01); G06T 17/10 (2006.01);
U.S. Cl.
CPC ...
G06F 17/30961 (2013.01); G06F 17/30327 (2013.01); G06F 17/30563 (2013.01); G06T 1/60 (2013.01); G06T 15/005 (2013.01); G06T 15/06 (2013.01); G06T 15/08 (2013.01); G06T 15/10 (2013.01); G06T 15/80 (2013.01); G06T 17/10 (2013.01); H04N 19/174 (2014.11); H04N 19/44 (2014.11);
Abstract

A system, method, and computer program product for implementing a tree traversal operation for a tree data structure divided into compression blocks is disclosed. The method includes the steps of receiving at least a portion of a tree data structure that represents a tree having a plurality of nodes, pushing a root node of the tree data structure onto a traversal stack data structure associated with an outer loop of a tree traversal operation algorithm, and, for each iteration of an outer loop of a tree traversal operation algorithm, popping a top element from the traversal stack data structure and processing, via an inner loop of the tree traversal operation algorithm, the compression block data structure that corresponds with the top element. The tree data structure may be encoded as a plurality of compression block data structures that each include data associated with a subset of nodes of the tree.


Find Patent Forward Citations

Loading…