Yo, I heard you guys like to traverse BVHs...
category: gfx [glöplog]
How about a new way to do that? :) My algorithm (it's me, Constantine :D) can even beat Smits 1998, since you can reorder nodes right when they are inserted into the array of node indices. Pretty cool, right? :D
youtu.be/akSOxNgX_fY
youtu.be/akSOxNgX_fY
Yo, I heard you like videos that should be a .txt file (complete with an AI voice that reads said .txt file)
that video should be a .txt file and I should be an orca... and yet...
But.. that's just the basic (hardcoded to a binary tree) implementation that can be found on wikipedia? The fact that you skip traversing child nodes of a non intersecting parent node is certainly not what makes your algorithm unique but the basic principle of why we build BVHs in the first place ... ;)
