DescriptionSpatial quadtree structure of the Barnes-Hut algorithm in the N-body problem.gif
English: Example two-dimensional N-body simulation of two merges (N=20.000) alongisde the quadtree spatial structure of the Barnes-Hut algorithm that cuts computational complexity from O(N^2) to O(N logN) via hierarchical force calculation.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Example two-dimensional N-body simulation of two merges (N=20.000) alongisde the quadtree spatial structure of the Barnes-Hut algorithm that cuts computational complexity from O(N^2) to O(N logN) via hierarchical force calculation.