gangsta

I’ve taken a break from the main gangsta development to investigate the Bounding Interval Hierachy acceleration structure as a possible alternative to the KD-Tree. The BIH has performance similar to the KD-Tree, but is very quick to build and has a relatively small memory footprint. It’s also an incredibly simple structure to implement. The BIH was described in a paper by Carsten Wächter and Alexander Keller.

One of my design goals for gangsta is to have dynamic subdivision surface and microtriangle displacement support, which will mean building trees to hold many microtriangles on the fly, so a fast-to-build structure is essential.

The image above shows gs::rt rendering the 100,000 triangle buddha model in real-time. There are a few bugs to fix as there are holes in the model, but it’s very pleasing to have got half-decent performance from a naïve implementation