The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Feb. 04, 2025

Filed:

Aug. 05, 2022
Applicant:

Apple Inc., Cupertino, CA (US);

Inventors:

Ali Rabbani Rankouhi, St Albans, GB;

Christopher A. Burns, Bushey, GB;

Justin A. Hensley, Mountain View, CA (US);

Luca Iuliano, Milton Keynes, GB;

Jonathan M. Redshaw, St Albans, GB;

Assignee:

Apple Inc., Cupertino, CA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06T 15/06 (2011.01); G06F 9/38 (2018.01); G06F 9/48 (2006.01); G06F 9/50 (2006.01); G06F 16/22 (2019.01); G06F 30/31 (2020.01); G06T 1/20 (2006.01); G06T 1/60 (2006.01); G06T 15/00 (2011.01); G06T 17/00 (2006.01); G06Q 10/101 (2023.01); G06Q 50/04 (2012.01); G06T 17/10 (2006.01); G16H 40/67 (2018.01);
U.S. Cl.
CPC ...
G06T 15/06 (2013.01); G06F 9/3887 (2013.01); G06F 9/3888 (2023.08); G06F 9/38885 (2023.08); G06F 9/4881 (2013.01); G06F 9/5016 (2013.01); G06F 9/5027 (2013.01); G06F 16/2246 (2019.01); G06F 30/31 (2020.01); G06T 1/20 (2013.01); G06T 1/60 (2013.01); G06T 15/005 (2013.01); G06T 17/005 (2013.01); G06Q 10/101 (2013.01); G06Q 50/04 (2013.01); G06T 17/00 (2013.01); G06T 17/10 (2013.01); G06T 2210/12 (2013.01); G06T 2210/21 (2013.01); G16H 40/67 (2018.01);
Abstract

Disclosed techniques relate to acceleration data structure for ray intersection testing. In some embodiments, storage circuitry stores node data for a spatially organized acceleration data structure, including to store the following node information for a given node: origin coordinates for the node and, for a given child node of multiple child nodes, child information that includes: quantized bounding region information for a bounding region corresponding to the child node, where the quantized bounding region information encodes bounding region coordinates as offsets relative to the origin coordinates. Traversal circuitry may traverse multiple nodes of the data structure and determine whether a ray intersects a bounding region indicated by given a node of the data structure based on the node information. Disclosed techniques may provide substantial improvements to performance, data size, and power consumption.


Find Patent Forward Citations

Loading…