公开(公告)号：US20170249779A1

公开(公告)日：2017-08-31

申请号：US15053930

申请日：2016-02-25

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert

IPC: G06T15/80 ,  G06T15/06

CPC classification number: G06T15/80 ,  G06T15/06

Abstract: At least one processor may organize a plurality of primitives of a scene in a hierarchical data structure, wherein a plurality of bounding volumes are associated with a plurality of nodes of the hierarchical data structure. The at least one processor may rasterize a representation of each of the plurality of bounding volumes to an off-screen render target in the memory. The at least one processor may determine, based at least in part on a pixel in the off-screen render target that maps to a ray in the scene, a non-root node of the hierarchical data structure associated with the pixel as a start node to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine whether the ray in the scene intersects one of the plurality of primitives.

公开(公告)号：US09697640B2

公开(公告)日：2017-07-04

申请号：US14257385

申请日：2014-04-21

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert ,  Vineet Goel ,  Ouns Mouri

IPC: G06T15/06 ,  G06K9/00

CPC classification number: G06T15/06 ,  G06T2210/12

Abstract: At least one processor may organize a plurality of primitives in a hierarchical data structure. The at least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target. The at least one processor may determine a bounding volume that is intersected by a ray out of the plurality of bounding volumes. The at least one processor may determine a non-root node of the hierarchical data structure that is associated with the bounding volume as a start node in the hierarchical data structure to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine the primitive that is intersected by the ray.

公开(公告)号：US09984492B2

公开(公告)日：2018-05-29

申请号：US14831726

申请日：2015-08-20

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert

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

CPC classification number: G06T15/06 ,  G06T1/20 ,  G06T15/005 ,  G06T15/08 ,  G06T17/005

Abstract: Methods and systems disclosed improve the efficiency of ray tracing. In one aspect, a method of ray tracing in a digital representation of a scene includes segmenting the scene into a plurality of voxels, associating each of the voxels with a node of a bounding volume hierarchy (BVH) representing one or more object primitives within the scene, determining a set of voxels through which the ray passes, determining a set of nodes associated with the set of voxels, determining a deepest common ancestor node of the set of nodes, traversing the hierarchy starting at the deepest common ancestor node to determine a point of intersection between the ray and one of the one or more object primitives; and updating a digital image of the scene based on the determined point of intersection.

公开(公告)号：US09818221B2

公开(公告)日：2017-11-14

申请号：US15053930

申请日：2016-02-25

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert

IPC: G06T15/00 ,  G06T15/80 ,  G06T15/06

CPC classification number: G06T15/80 ,  G06T15/06

Abstract: At least one processor may organize a plurality of primitives of a scene in a hierarchical data structure, wherein a plurality of bounding volumes are associated with a plurality of nodes of the hierarchical data structure. The at least one processor may rasterize a representation of each of the plurality of bounding volumes to an off-screen render target in the memory. The at least one processor may determine, based at least in part on a pixel in the off-screen render target that maps to a ray in the scene, a non-root node of the hierarchical data structure associated with the pixel as a start node to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine whether the ray in the scene intersects one of the plurality of primitives.

公开(公告)号：US20160350892A1

公开(公告)日：2016-12-01

申请号：US14855962

申请日：2015-09-16

Applicant: QUALCOMM Incorporated

Inventor： Gang Zhong ,  Vineet Goel ,  Young In Yeo ,  Juraj Obert

IPC: G06T1/20 ,  G06T15/80 ,  H04N13/04 ,  G06T15/00 ,  H04N13/02 ,  H04N13/00

CPC classification number: G06T1/20 ,  G06T15/005 ,  G06T15/80 ,  H04N13/106 ,  H04N13/139 ,  H04N13/261 ,  H04N13/275 ,  H04N13/30

Abstract: Techniques are described for stereoscopic view generation. A graphics processing unit (GPU) may combine attribute information for two or more corresponding vertices of corresponding primitives in different views. The GPU may process the combined attributed information to generate graphics data for the stereoscopic view.

Abstract translation: 描述了用于立体视图生成的技术。 图形处理单元（GPU）可以组合不同视图中对应图元的两个或多个对应顶点的属性信息。 GPU可以处理组合的归属信息以产生用于立体视图的图形数据。

公开(公告)号：US20160292908A1

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

申请号：US14831726

申请日：2015-08-20

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert

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

CPC classification number: G06T15/06 ,  G06T1/20 ,  G06T15/005 ,  G06T15/08 ,  G06T17/005

Abstract: Methods and systems disclosed improve the efficiency of ray tracing. In one aspect, a method of ray tracing in a digital representation of a scene includes segmenting the scene into a plurality of voxels, associating each of the voxels with a node of a bounding volume hierarchy (BVH) representing one or more object primitives within the scene, determining a set of voxels through which the ray passes, determining a set of nodes associated with the set of voxels, determining a deepest common ancestor node of the set of nodes, traversing the hierarchy starting at the deepest common ancestor node to determine a point of intersection between the ray and one of the one or more object primitives; and updating a digital image of the scene based on the determined point of intersection.

Abstract translation: 所公开的方法和系统提高了光线跟踪的效率。 在一个方面，一种在场景的数字表示中的光线跟踪的方法包括将场景分割为多个体素，将每个体素与表示一个或多个对象基元的边界体积分层（BVH）的节点相关联， 确定射线通过的一组体素，确定与该组体素相关联的一组节点，确定该节点组中最深的共同祖先节点，从最深的共同祖先节点开始遍历该层次结构以确定 射线与一个或多个对象图元之一的交点; 以及基于确定的交叉点来更新场景的数字图像。

公开(公告)号：US20150302629A1

公开(公告)日：2015-10-22

申请号：US14257385

申请日：2014-04-21

Applicant: QUALCOMM Incorporated

Inventor： Juraj Obert ,  Vineet Goel ,  Ouns Mouri

IPC: G06T15/06

CPC classification number: G06T15/06 ,  G06T2210/12

Abstract: At least one processor may organize a plurality of primitives in a hierarchical data structure. The at least one processor may rasterize a plurality of bounding volumes associated with non-root nodes of the hierarchical data structure to an off-screen render target. The at least one processor may determine a bounding volume that is intersected by a ray out of the plurality of bounding volumes. The at least one processor may determine a non-root node of the hierarchical data structure that is associated with the bounding volume as a start node in the hierarchical data structure to start traversal of the hierarchical data structure. The at least one processor may traverse the hierarchical data structure starting from the start node to determine the primitive that is intersected by the ray.

Abstract translation: 至少一个处理器可以在分层数据结构中组织多个基元。 所述至少一个处理器可以将与分层数据结构的非根节点相关联的多个边界卷光栅化为离屏渲染目标。 所述至少一个处理器可以确定由所述多个边界卷中的射线相交的边界体积。 所述至少一个处理器可以确定与所述分层数据结构相关联的所述分层数据结构的非根节点作为所述分层数据结构中的起始节点，以开始遍历所述分层数据结构。 至少一个处理器可以从开始节点开始遍历分层数据结构，以确定与射线相交的原语。