Early termination in bottom-up acceleration data structure refit

A method comprising:

• constructing a hierarchical acceleration data structure comprising a plurality of hierarchically arranged nodes;
• traversing one or more rays through the hierarchical acceleration data structure;
• determining intersections between the one or more rays and one or more primitives within the hierarchical acceleration data structure;
• performing refit operations on nodes of the hierarchical acceleration data structure to adjust spatial dimensions of one or more of the nodes;
• receiving refit data associated with refitting one or more child nodes of a current node;
• and
• skipping performing refit operations on the current node responsive to that the refit data indicates that space occupancy of the one or more child nodes has shrunk but the one or more child nodes are still bounded by the current node.

A non-transitory machine-readable medium having program code stored thereon which, when executed by a machine, causes the machine to perform operations of:

• constructing a hierarchical acceleration data structure comprising a plurality of hierarchically arranged nodes;
• traversing one or more rays through the hierarchical acceleration data structure;
• determining intersections between the one or more rays and one or more primitives within the hierarchical acceleration data structure;
• performing refit operations on nodes of the hierarchical acceleration data structure to adjust spatial dimensions of one or more of the nodes;
• receiving refit data associated with refitting one or more child nodes of a current node;
• and
• skipping performing refit operations on the current node responsive to that the refit data indicates that space occupancy of the one or more child nodes has shrunk but the one or more child nodes are still bounded by the current node.