News for hackers. Stuff that matters.
Re:Graphics Deep Dive: Cascaded Voxel Cone Tracing in the To... by blt on Monday November 28, 2016 @01:47PM (#13057475)
I'm not the author, but I assume they are referring to the amount of conditional branching needed to descend a standard octree. However I bet there is lots of active research into GPU-optimized spatial partition data structures.

The data structure in the article is different because it only stores high resolution data for the area near the player. An Octree handles arbitrary distributions of high resolution data, so it is more powerful than needed for this application. I like it when insights into the problem lead to simpler algorithms.

Re:Graphics Deep Dive: Cascaded Voxel Cone Tracing in the To... by cma on Monday November 28, 2016 @03:28PM (#13058119)
Re:Graphics Deep Dive: Cascaded Voxel Cone Tracing in the To... by randyrand on Monday November 28, 2016 @05:37PM (#13059041)
In a proper implementation, the data diverges (which is relatively fine) but the code/program counter does not diverge (which is what you want to avoid).

There is nothing bad about Octrees on the GPU, but most people use BVH trees now.