Hierarchical Data Structures (Octrees) for Big Data

Octrees and BONO trees

[pravinpoudel]

4:09 how does the number of node calculations get (logs -1)^2? if that log is base on 2, isn't it supposed to be 8^(logs-1).

[MyLittleMagneton]

I'm guessing the pros of storing the nodes in an array, is that you have faster access (as you don't have to iterate down through the root), and fewer cache misses, correct?

[henrytien]

Great, but now I can't understand it.