More Voxel Data Structures #92
Description
Currently, we just have run length encoded interval trees, while they are generally good it would be nice to have an option for other data structures to best suit any given use case.
We can start with these 3 options
- naive array - max-performance, more memory
- RLE (Interval trees) - good performance (read efficient), good compression
- Octrees - decent performance (simpler write), best compression, and also would allow for LOD's
We would need to implement all the above as native containers and, the config would be an issue since burst C# doesn't have interfaces we can't provide a run-time switch the user will need to do a source level change