Version 0.1.0
Features
Generate an optimized KDtree using SAH in O(N log(N))
.
Intersect the kdtree with a ray to retrieve primitives that could intersect this ray.
Generate an optimized KDtree using SAH in O(N log(N))
.
Intersect the kdtree with a ray to retrieve primitives that could intersect this ray.