@skal65535.bsky.social
Light version of Zero-Byte-BVH here:
skal65535.github.io/BVH/
The idea is to order the triangles as a binary tree by groups of 6 triangles, each group defines a bounding box to test. If hit, recurse both half of the remaining triangles.
[https://www.codercorner.com/ZeroByteBVH.pdf]
skal65535.github.io/BVH/
The idea is to order the triangles as a binary tree by groups of 6 triangles, each group defines a bounding box to test. If hit, recurse both half of the remaining triangles.
[https://www.codercorner.com/ZeroByteBVH.pdf]
June 17, 2025 at 10:21 PM
Light version of Zero-Byte-BVH here:
skal65535.github.io/BVH/
The idea is to order the triangles as a binary tree by groups of 6 triangles, each group defines a bounding box to test. If hit, recurse both half of the remaining triangles.
[https://www.codercorner.com/ZeroByteBVH.pdf]
skal65535.github.io/BVH/
The idea is to order the triangles as a binary tree by groups of 6 triangles, each group defines a bounding box to test. If hit, recurse both half of the remaining triangles.
[https://www.codercorner.com/ZeroByteBVH.pdf]