Skip to content

Latest commit

 

History

3 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

dacrt

Divide-and-conquer ray tracing

These are some of my own implementations of the article Naive ray-tracing: A divide-and-conquer approach

  • dacrt: basic CPU version
  • dacrt_simd: more optimized SIMD version
  • dacrt_async: experiments doing the spatial subdivision on the CPU and the ray-triangle intersection on the GPU (using CUDA)

The main bottleneck of this last approach was the logical dependencies between the CPU "traversal" and GPU intersections. We need to wait for the intersection results on the GPU in order to decide if we need to proceed with spatial traversal on the CPU and vice-versa.

About

Divide-and-conquer ray tracing

Topics

Resources

Stars

2 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages