Time complexity: Build tree: n log(n) Insert: log(n) ~ n Remove: n Update: n Qeury: log(n) ~ n Highly inspried by @komafami #bvh #dynamic
