Relative encoding for a block-based bounding volume hierarchy

摘要

A procedure with:Receive at least part of a tree data structure representing a tree with multiple nodes; andProcess, by a tree traversing operation algorithm executed by a tree traversing unit of a parallel processing unit, one or more nodes of the tree data structure, by cutting one or more nodes of the tree data structure with a query data structure,wherein a first local coordinate system associated with a first node of the plurality of nodes and a second local coordinate system associated with a second node of the plurality of nodes are encoded in the tree data structure, where the first node is a predecessor of the second node in a hierarchy of the tree data structure, andwhere the first local coordinate system and the second local coordinate system are specified relative to a global coordinate system, wherein the tree traversing unit is a dispatching unit (510) a setup unit (520),one or more traversing units (530),has a stack management unit and a local memory for multiple query data structures, wherein the dispatching unit retrieves a new node of the tree from a traversing stack from the local memory, loads the necessary data for traversing the tree into the local memory, and notifies the setup unit, configure one or more traversing units to perform the tree traversing operation.