公开(公告)号：US11164360B2

公开(公告)日：2021-11-02

申请号：US16919700

申请日：2020-07-02

Applicant: NVIDIA Corporation

Inventor： Samuli Laine ,  Tero Karras ,  Greg Muthler ,  William Parsons Newhall ,  Ronald Charles Babich ,  Ignacio Llamas ,  John Burgess

IPC: G06T15/06 ,  G06T1/20 ,  G06T15/00

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to provide a deterministic result of intersected triangles regardless of the order that the memory subsystem returns triangle range blocks for processing, while opportunistically eliminating alpha intersections that lie further along the length of the ray than closer opaque intersections.

公开(公告)号：US20130235049A1

公开(公告)日：2013-09-12

申请号：US13732103

申请日：2012-12-31

Applicant: NVIDIA CORPORATION

Inventor： Tero Karras

IPC: G06T1/20

CPC classification number: G06T15/00 ,  G06T1/20 ,  G06T17/005 ,  G06T2210/52

Abstract: A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method for constructing bounding volume hierarchies from binary trees is disclosed. The method includes providing a binary tree including a plurality of leaf nodes and a plurality of internal nodes. Each of the plurality of internal nodes is uniquely associated with two child nodes, wherein each child node comprises either an internal node or leaf node. The method also includes determining a plurality of bounding volumes for nodes in the binary tree by traversing the binary tree from the plurality of leaf nodes upwards toward a root node, wherein each parent node is processed once by a later arriving corresponding child node.

Abstract translation: 公开了一种具有用于使计算机系统执行用于从二叉树构建边界体层次的方法的计算机可执行指令的非暂时性计算机可读存储介质。 该方法包括提供包括多个叶节点和多个内部节点的二进制树。 多个内部节点中的每一个与两个子节点唯一相关联，其中每个子节点包括内部节点或叶节点。 该方法还包括通过从多个叶节点向上朝向根节点遍历二叉树来确定二叉树中的节点的多个边界卷，其中每个父节点由稍后到达的相应子节点处理一次。

公开(公告)号：US20230298258A1

公开(公告)日：2023-09-21

申请号：US18198949

申请日：2023-05-18

Applicant: NVIDIA Corporation

Inventor： Samuli LAINE ,  Tero Karras ,  Timo Aila ,  Robert Ohannessian ,  William Parsons Newhall, JR. ,  Greg Muthler ,  Ian Kwong ,  Peter Nelson ,  John Burgess

IPC: G06T15/06 ,  G06T15/00

CPC classification number: G06T15/06 ,  G06T15/005

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to properly handle numerically challenging computations at or near edges and/or vertices of primitives and/or ensure that a single intersection is reported when a ray intersects a surface formed by primitives at or near edges and/or vertices of the primitives.

公开(公告)号：US20220230380A1

公开(公告)日：2022-07-21

申请号：US17716599

申请日：2022-04-08

Applicant: NVIDIA Corporation

Inventor： Samuli Laine ,  Tero Karras ,  Timo Aila ,  Robert Ohannessian ,  William Parsons Newhall, JR. ,  Greg Muthler ,  Ian Kwong ,  Peter Nelson ,  John Burgess

IPC: G06T15/06 ,  G06T15/00

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to properly handle numerically challenging computations at or near edges and/or vertices of primitives and/or ensure that a single intersection is reported when a ray intersects a surface formed by primitives at or near edges and/or vertices of the primitives.

公开(公告)号：US20220058856A1

公开(公告)日：2022-02-24

申请号：US17520100

申请日：2021-11-05

Applicant: NVIDIA Corporation

Inventor： Greg Muthler ,  Tero Karras ,  Samuli Laine ,  William Parsons Newhall, JR. ,  Ronald Charles Babich, JR. ,  John Burgess ,  Ignacio Llamas

IPC: G06T15/06

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to omit reporting of one or more primitives the ray is determined to intersect. The omitted primitives include primitives which are provably capable of being omitted without a functional impact on visualizing the virtual scene.

公开(公告)号：US10740952B2

公开(公告)日：2020-08-11

申请号：US16101196

申请日：2018-08-10

Applicant: NVIDIA Corporation

Inventor： Samuli Laine ,  Tero Karras ,  Greg Muthler ,  William Parsons Newhall, Jr. ,  Ronald Charles Babich ,  Ignacio Llamas ,  John Burgess

IPC: G06T15/06 ,  G06T1/20 ,  G06T15/00

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include opaque and alpha triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to determine primitives intersected by the ray, and return intersection information to a streaming multiprocessor for further processing. The hardware-based traversal coprocessor is configured to provide a deterministic result of intersected triangles regardless of the order that the memory subsystem returns triangle range blocks for processing, while opportunistically eliminating alpha intersections that lie further along the length of the ray than closer opaque intersections.

公开(公告)号：US20200051314A1

公开(公告)日：2020-02-13

申请号：US16101148

申请日：2018-08-10

Applicant: NVIDIA Corporation

Inventor： Samuli Laine ,  Tero Karras ,  Timo Aila ,  Robert Ohannessian ,  William Parsons Newhall, JR. ,  Greg Muthler ,  Ian Kwong ,  Peter Nelson ,  John Burgess

IPC: G06T15/06 ,  G06T17/00 ,  G06T15/00

Abstract: A hardware-based traversal coprocessor provides acceleration of tree traversal operations searching for intersections between primitives represented in a tree data structure and a ray. The primitives may include triangles used in generating a virtual scene. The hardware-based traversal coprocessor is configured to properly handle numerically challenging computations at or near edges and/or vertices of primitives and/or ensure that a single intersection is reported when a ray intersects a surface formed by primitives at or near edges and/or vertices of the primitives.

公开(公告)号：US09437039B2

公开(公告)日：2016-09-06

申请号：US13730320

申请日：2012-12-28

Applicant: NVIDIA Corporation

Inventor： Jaakko Lehtinen ,  Timo Aila ,  Samuli Laine ,  Tero Karras ,  David Luebke

IPC: G06T15/50

CPC classification number: G06T15/50 ,  G06T15/506

Abstract: A method of generating an image. The method includes simulating a presence of at least one light source within a virtualized three dimensional space. Within the virtualized three dimensional space, a light sensing plane is defined. The light sensing plane includes a matrix of a number of pixels to be displayed on a display screen. The method further includes using a light transport procedure, computing a gradient value for each pixel of the matrix to produce a number of gradient values. The gradient computation involves selecting a plurality of light path pairs that contribute to a pixel wherein the selection is biased towards selection of more light paths that pass through pixels having larger gradient values. The plurality of gradient values are converted to a plurality of light intensity values which represent the image.

Abstract translation: 一种产生图像的方法。 该方法包括模拟虚拟三维空间内的至少一个光源的存在。 在虚拟三维空间内，定义光感测平面。 光检测平面包括要在显示屏上显示的多个像素的矩阵。 该方法还包括使用光传输过程，计算矩阵的每个像素的梯度值以产生多个梯度值。 梯度计算涉及选择有助于像素的多个光路对，其中选择偏向选择通过具有较大梯度值的像素的更多光路径。 将多个梯度值转换为表示图像的多个光强度值。

公开(公告)号：US20140071129A1

公开(公告)日：2014-03-13

申请号：US13730320

申请日：2012-12-28

Applicant: NVIDIA CORPORATION

Inventor： Jaakko Lehtinen ,  Timo Aila ,  Samuli Laine ,  Tero Karras ,  David Luebke

IPC: G06T15/50

CPC classification number: G06T15/50 ,  G06T15/506

Abstract: A method of generating an image. The method includes simulating a presence of at least one light source within a virtualized three dimensional space. Within the virtualized three dimensional space, a light sensing plane is defined. The light sensing plane includes a matrix of a number of pixels to be displayed on a display screen. The method further includes using a light transport procedure, computing a gradient value for each pixel of the matrix to produce a number of gradient values. The gradient computation involves selecting a plurality of light path pairs that contribute to a pixel wherein the selection is biased towards selection of more light paths that pass through pixels having larger gradient values. The plurality of gradient values are converted to a plurality of light intensity values which represent the image.

Abstract translation: 一种产生图像的方法。 该方法包括模拟虚拟三维空间内的至少一个光源的存在。 在虚拟三维空间内，定义光感测平面。 光检测平面包括要在显示屏上显示的多个像素的矩阵。 该方法还包括使用光传输过程，计算矩阵的每个像素的梯度值以产生多个梯度值。 梯度计算涉及选择有助于像素的多个光路对，其中选择偏向选择通过具有较大梯度值的像素的更多光路径。 将多个梯度值转换为表示图像的多个光强度值。

公开(公告)号：US20130235031A1

公开(公告)日：2013-09-12

申请号：US13727492

申请日：2012-12-26

Applicant: NVIDIA CORPORATION

Inventor： Tero Karras

IPC: G06T15/00

CPC classification number: G06T15/00 ,  G06T1/20 ,  G06T17/005 ,  G06T2210/52

Abstract: A system and method for constructing binary radix trees in parallel, which are used for as a building block for constructing secondary trees. A non-transitory computer-readable storage medium having computer-executable instructions for causing a computer system to perform a method is disclosed. The method includes determining a plurality of primitives comprising a total number of primitive nodes that are indexed, wherein the plurality of primitives correspond to leaf nodes of a hierarchical tree. The method includes sorting the plurality of primitives. The method includes building the hierarchical tree in a manner requiring at most a linear amount of temporary storage with respect to the total number of primitive nodes. The method includes building an internal node of the hierarchical tree in parallel with one or more of its ancestor nodes.

Abstract translation: 并行构建二叉树的系统和方法，用于构建二次树的构建块。 公开了一种具有用于使计算机系统执行方法的计算机可执行指令的非暂时性计算机可读存储介质。 该方法包括确定包括索引的总数目的原始节点的多个图元，其中多个图元对应于分层树的叶节点。 该方法包括对多个基元进行排序。 该方法包括以相对于原始节点的总数最多需要线性量的临时存储的方式构建分层树。 该方法包括与其祖先节点中的一个或多个并行地构建分层树的内部节点。