Display title | Broken/Barnes–Hut simulation |
Default sort key | Barnes-Hut simulation |
Page length (in bytes) | 6,014 |
Namespace ID | 0 |
Page ID | 4087 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>Jworkorg |
Date of page creation | 12:27, 23 October 2019 |
Latest editor | imported>Jworkorg |
Date of latest edit | 12:27, 23 October 2019 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | The Barnes–Hut simulation (named after Josh Barnes and Piet Hut) is an approximation algorithm for performing an n-body simulation. It is notable for having order O(n log n) compared to a direct-sum algorithm which would be O(n2).
The simulation volume is usually divided up into cubic cells... |