vanruesc
commented
4 years ago I'm wondering how does it work in term of performance: initilization of the tree, insertion time and retrieve time?
I recommend reading https://geidav.wordpress.com/2014/07/18/advanced-octrees-1-preliminaries-insertion-strategies-and-max-tree-depth/ and the other articles in that series to explore octree data structures.
Right now I use a Map to store/retrieve data but basically I convert 3d position to a new number that I then use as a key in the map - that is quite inefficient and I hope octree can help me achieve almost real-time performance for everything!
Linear octrees are basically 3D hash maps that work by converting 3D positions into keys. Spatial searches can make use of intermediate octants that store information about the existence of child nodes but it all depends on the shape and type of data you're trying to manage.
Hello, I have a 1000x1000x1000 3d sparse space and I want to convert it to an octree. I'm wondering how does it work in term of performance: initilization of the tree, insertion time and retrieve time?
Right now I use a Map to store/retrieve data but basically I convert 3d position to a new number that I then use as a key in the map - that is quite inefficient and I hope octree can help me achieve almost real-time performance for everything!
Great work!