You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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
The text was updated successfully, but these errors were encountered:
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
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
The text was updated successfully, but these errors were encountered: