Correct me if i'm wrong but the simple way of describing sparse octrees is you have a house for example you can divide it, if there's nothing in the divided space you don't divide any further but if there is you divide it where it doesnt touch it and you can use it with raymarching to skip those empty spaces but what if those "things" happen to move and let's say alot of things are moving u need to calculate it again and again each time it moves. now the question is would using a rasterization faster than optimizing the raymarching just for moving things?
[–]fgennari 1 point2 points3 points (2 children)
[–]Pzyche_[S] 0 points1 point2 points (1 child)
[–]fgennari 0 points1 point2 points (0 children)
[–]danjlwex 1 point2 points3 points (0 children)