N-body (Barnes Hut) Algorithm
Compute the attractions of the other points by traversing the tree; at a node, if the bodies are close, computer pairwise attractions; if they are distant, compute approximation and do not traverse any lower
Totality of attractions induces a new position
Variations --
- Alternative tree structures
- Salmon uses an out of core algorithm using a space filling curve to promote locality