Ray intersection data structure with many-to-many mapping between bounding regions and primitives
US11335061B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 24, 2020 |
| Grant date | May 17, 2022 |
| Priority date | — |
| Expiry date | Nov 24, 2040 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02P90/30
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Disclosed techniques relate to an acceleration data structure for ray intersection with a many-to-many mapping between bounding regions and primitives. In some embodiments, one or more graphics processors access data for multiple graphics primitives in a graphics scene and generate a spatially organized data structure. Some nodes of the data structure indicate graphics primitives and some nodes indicate coordinates of bounding regions in the graphics scene. In some embodiments, the spatially organized data structure includes a node with a bounding region for which multiple primitives are indicated as children and also includes a primitive for which multiple bounding regions are indicated as parents. Disclosed techniques may generate bounding regions that closely fit primitives, which may reduce primitive testing for ray tracing. This in turn may increase performance or reduce power consumption relative to traditional techniques.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.