公开(公告)号：US20150348308A1

公开(公告)日：2015-12-03

申请号：US14722887

申请日：2015-05-27

Applicant: Samsung Electronics Co., Ltd.

Inventor： Jaedon Lee ,  Youngsam Shin ,  Wonjong Lee ,  Seokjoong Hwang

IPC: G06T15/06

CPC classification number: G06T15/06 ,  G06T2210/12 ,  G06T2210/52

Abstract: A method of traversing an acceleration structure (AS) in a ray tracing system includes obtaining information about child nodes of a target node included in the AS; determining whether each of the child nodes intersects a ray based on the obtained information; determining a next target node among at least one child node that intersects the ray; and performing an operation corresponding to a type of the determined next target node.

Abstract translation: 在光线跟踪系统中遍历加速结构（AS）的方法包括：获取关于AS中包括的目标节点的子节点的信息; 基于获得的信息确定每个子节点是否与射线相交; 确定与所述射线相交的至少一个子节点中的下一目标节点; 以及执行与所确定的下一个目标节点的类型相对应的操作。

公开(公告)号：US20150138202A1

公开(公告)日：2015-05-21

申请号：US14548669

申请日：2014-11-20

Applicant: SAMSUNG ELECTRONICS CO., LTD.

Inventor： Jaedon Lee ,  Youngsam Shin ,  Wonjong Lee

IPC: G06T15/06

CPC classification number: G06T15/06 ,  G06T15/005 ,  G06T17/005

Abstract: A restart method of traversing a binary tree in a ray tracing system includes traversing a tree consisting of a hierarchical acceleration structure using one-bit stacks respectively assigned to levels of the binary tree and restarting at a highest level at which a corresponding one-bit stack has a value indicating that a child node has not yet been traversed, thereby decreasing the capacity of a stack memory required.

Abstract translation: 在光线跟踪系统中遍历二叉树的重新启动方法包括遍历由分层加速结构组成的树，其使用分配给二进制树的级别的一位堆栈并在最高级重新启动，在最高级别处，相应的一位堆栈 具有指示子节点尚未被遍历的值，从而降低了所需的堆栈存储器的容量。