Faster ray packets - triangle intersection through vertex culling

  • Authors:
  • Alexander Reshetov

  • Affiliations:
  • Intel Corporation

  • Venue:
  • ACM SIGGRAPH 2007 posters
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

To eliminate unnecessary ray packet-triangle intersection tests, we check for separation of two convex objects: a triangle and a frustum containing intersections of rays with a leaf node of an acceleration structure. We show a performance improvement that is proportional to the ratio of lengths of average leaf edge to triangle edge, which opens new possibilities for creation of better acceleration structures.