Could anybody clarify why the expected number of nodes touched would be around log(N)/(theta)^2?
http://arxiv.org/pdf/astro-ph/0202512.pdf
Here is the original paper describing Barnes-Hut!
You might also find this explanation of the Barnes-Hut algorithm helpful. Lots of visuals. :)
Oh wow. That's outstanding. I'm going to ask to use their diagrams next year. They are way better than mine.
The structure looks like kd-tree. Does Barnes-Hut tree have relationship with KD-tree?
Could anybody clarify why the expected number of nodes touched would be around log(N)/(theta)^2?
http://arxiv.org/pdf/astro-ph/0202512.pdf
Here is the original paper describing Barnes-Hut!
You might also find this explanation of the Barnes-Hut algorithm helpful. Lots of visuals. :)
Oh wow. That's outstanding. I'm going to ask to use their diagrams next year. They are way better than mine.
The structure looks like kd-tree. Does Barnes-Hut tree have relationship with KD-tree?