Information for "Broken/Barnes–Hut simulation"

From HandWiki

Basic information

Display titleBroken/Barnes–Hut simulation
Default sort keyBarnes-Hut simulation
Page length (in bytes)6,014
Namespace ID0
Page ID4087
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Jworkorg
Date of page creation12:27, 23 October 2019
Latest editorimported>Jworkorg
Date of latest edit12:27, 23 October 2019
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (33)

Templates used on this page:

SEO properties

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...
Information from Extension:WikiSEO