Procedural Primitives in DirectX Raytracing

Procedural primitives in DirectX Raytracing (DXR) are geometric entities defined by mathematical equations or algorithms rather than traditional triangle meshes. This article explains how DXR processes procedural geometry, the role of Axis-Aligned Bounding Boxes (AABBs) and custom Intersection Shaders, common use cases such as hair and mathematical spheres, and the key performance trade-offs associated with this technique.

Defining Procedural Primitives in DXR

In conventional real-time graphics and standard ray tracing pipelines, 3D models are composed of triangle lists. The ray tracing hardware excels at performing fast, dedicated ray-triangle intersection tests. However, representing complex geometric forms—such as hair strands, fur, curved tubes, or perfect mathematical spheres—using triangles requires massive amounts of geometry. This increases memory footprints and introduces polygon faceting.

DirectX Raytracing solves this with procedural primitives. Instead of defining a surface using vertices and indices, developers provide an Axis-Aligned Bounding Box (AABB) in the Bottom-Level Acceleration Structure (BLAS) and define the shape mathematically using a custom Intersection Shader.

How DXR Handles Procedural Geometry

The procedural primitive pipeline in DXR relies on three core components:

  1. AABB Definition in the BLAS: Geometry is declared using the D3D12_RAYTRACING_GEOMETRY_TYPE_PROCEDURAL_PRIMITIVE_AABBS flag. The developer supplies the minimum and maximum coordinates of a box enclosing the procedural object.
  2. Hardware Traversal: The GPU's ray tracing hardware traverses the acceleration structure. If a ray misses the AABB, it is discarded immediately. If the ray intersects the bounding box, hardware traversal pauses.
  3. Custom Intersection Shaders: DXR invokes a user-written Intersection Shader for the candidate primitive. Inside this shader, the developer writes code to compute the exact analytical intersection between the ray and the procedural shape.

If the shader detects an intersection within the valid ray interval, it calls the intrinsic function ReportHit(). This registers the hit distance and passes user-defined attribute structures downstream to Any-Hit or Closest-Hit shaders for material evaluation and shading.

Common Use Cases

  • Spheres and Particles: Perfect spheres can be evaluated analytically using a simple quadratic equation. This is ideal for particle systems, scientific visualization of molecules, and point cloud rendering without requiring tessellation.
  • Hair, Fur, and Splines: Rendering realistic hair requires thousands of long, thin strands. Representing these as cylindrical splines (such as Bézier or Catmull-Rom curves) bounded by AABBs avoids millions of micro-triangles, drastically reducing memory consumption while maintaining continuous curvature.
  • Signed Distance Fields (SDFs): Raymarching algorithms can be integrated directly inside the Intersection Shader to render complex, dynamic, or organically blending shapes defined by volumetric distance functions.

Performance Considerations

While procedural primitives offer infinite geometric detail and minimal memory usage, they require careful optimization:

  • No Fixed-Function Acceleration: Triangle intersection is often executed on dedicated silicon (such as NVIDIA RT Cores). Procedural intersections execute on general-purpose compute units via shaders, making each individual test significantly more computationally expensive.
  • Tight Bounding Boxes: Overly conservative AABBs cause excessive false-positive ray-box hits, triggering unnecessary Intersection Shader invocations. Tight, dynamic bounds are essential for maintaining real-time frame rates.
  • AABB Overlap: Highly overlapping bounding boxes—common with dense clusters of hair or particles—lead to redundant shader executions for rays passing through the overlapping regions.