US 11,989,818 B2
Apparatus and method for efficiently merging bounding volume hierarchy data
Carsten Benthin, Voelklingen (DE); and Sven Woop, Völklingen (DE)
Assigned to Intel Corporation, Santa Clara, CA (US)
Filed by INTEL CORPORATION, Santa Clara, CA (US)
Filed on Nov. 23, 2021, as Appl. No. 17/533,531.
Application 17/533,531 is a continuation of application No. 16/890,254, filed on Jun. 2, 2020, granted, now 11,189,074.
Application 16/890,254 is a continuation of application No. 15/488,359, filed on Apr. 14, 2017, granted, now 10,679,403, issued on Jun. 9, 2020.
Prior Publication US 2022/0157010 A1, May 19, 2022
Int. Cl. G06T 15/06 (2011.01); G06T 17/00 (2006.01)
CPC G06T 15/06 (2013.01) [G06T 17/00 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A graphics processing apparatus comprising:
a hierarchical tree structure construction circuitry to:
construct a top-level tree structure using root nodes of individual object tree structures, wherein an individual object tree structure of the individual object tree structures includes a root node and one or more child nodes and is built based on primitives included in a corresponding object, and
reconstruct build primitives within at least a portion of the top-level tree structure, wherein reconstructing the build primitives comprises:
iteratively selecting a plurality of build primitives from the portion of the top-level tree structure to split into a plurality of two subsets of build primitives for reconstruction, wherein in a first iteration of the iterative selection for reconstruction, a first pair of two subsets of build primitives is not reconstructed responsive to the first pair of two subsets of build primitives belonging to a same object.