Experimenting with Concurrent Binary Trees for Large Scale Terrain Rendering

[@slipster216]

It would be interesting to compare these results to hardware tessellation, as that shares many of the same properties in terms of results. At that triangle density, I'd expect the shading to become the primary bottleneck due to microtriangle issues, and that going to some type of index buffer approach rasterizing the index buffer in a compute shader (ala nanite) might be a huge win.

[@razzraziel]

Glad to see you're also following the latest developments/presentations.

[@danczer1]

Genius solution!

[@BL0B5TER]

11:33 What if the terrain isn't derived by a heightmap and instead has 3D features like caves or overhangs? 2.5D works, but I don't see how you'd easily sample vertices in 3D space.

[@santitabnavascues8673]

Maybe a initial model based in marching cubes could provide a good initial step for a tessellation scheme like this?

[@cvspvr]

transvoxel does this

[@tall_guy81]

So guys basically reinvented voxels but for polygons. Sounds crazy.

[@pacozalky721]

It's not clear to me how to parallel propagate subdivision into neighboring triangles. Is there a way how to avoid recursive subdivision on half-edges of main mesh triangles?

What videogame is at lower right at 15:20? (looks like a cat holding a lamp in isometric scenery)

[@thekite3h]

Where is sample project sources?

[@timmygilbert4102]

Isn't it the ROAM algorithm?

[@keabetsoemoses763]

it is

[@cvspvr]

nanite is still the god of lod