PROCESSOR AND METHOD FOR PAST-HIT-DRIVEN TRACE SEQUENCE FOR BEAM TRACKING

The GPU with programmable units and SIMT architecture optimizes ray tracing in complex scenes by dynamically distributing workloads and leveraging ray coherence, addressing performance bottlenecks and inefficiencies in BVH traversal.

DE102025147456A1Undetermined Publication Date: 2026-07-09INTEL CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
DE102025147456
Authority / Receiving Office
DE · DE
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-01-03
Filing Date
2025-11-17
Publication Date
2026-07-09

AI Technical Summary

Technical Problem

Ray tracing in complex scenes with millions of geometric primitives faces performance bottlenecks due to excessive intersection tests and inefficient traversal of Bounding Volume Hierarchies (BVH) trees, lacking adaptability and leveraging spatial and temporal coherence of rays for optimization.

Method used

Implementing a graphics processing unit (GPU) with programmable functional units and SIMT architecture, utilizing a scheduler for dynamic workload distribution across processing clusters, and employing a memory matrix for efficient data transfer and processing.

Benefits of technology

Enhances ray tracing performance by optimizing traversal through adaptive scene analysis and leveraging ray coherence, reducing redundant computations and improving frame rates in real-time applications.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

A processor is provided that is configured to traverse rays through a BVH tree; record paths of successful ray-primitive intersections of hit primitives to a root node of the BVH tree; update node visit counters, where the node visit counters correspond to the number of times a child node has been taken on the way to the root node, based on the recorded paths; determine a traversal order for children of a current node based on the node visit counters; and traverse the children nodes according to the determined traversal order.
Need to check novelty before this filing date? Find Prior Art