Skip to content

BVH tree accelerator
Compare
Choose a tag to compare
@Enigmatisms Enigmatisms released this 11 Apr 12:58
· 109 commits to master since this release
v1.2.1
1a0e54c
This commit was created on github.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

Marching towards v1.2.1, where we have our first BVH acceleration structure which is capable of accelerating ray intersection by reducing the amount of primitives to be taken into account. Tests showed that, for bunny scene which contains 14916 triangles, it only takes 30 ms to build BVH tree while achieving roughly 50x speed up compared to the brute force ray intersection which can only prune unnecessary computation via object bounding box. The implementation of BVH tree is done in C++ and I expose a python API via pybind/pybind11. All it takes is to build the bvh code and install locally with minimal effort. See the following figure with three Stanford Bunnies without mesh decimation (glass / conductor / Fresnel blend anisotropic) which is renderer within 15min.

pbr-bunny-bdpt

For other modifications, please refer to PR #10

Assets 2
Loading