Build a recursive inertial binary tree
Uses inertial bisection in a recursive manner until each leaf node has only one particle inside. Number of tree nodes is always 2*n_particle-1. Compute centroids
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(fmm_tree_type), | intent(inout) | :: | t |
Tree data structure to populate |
||
real(kind=rp), | intent(in), | target | :: | c_particle(:,:) |
Coordinates of the particles to insert in the tree |
|
real(kind=rp), | intent(in) | :: | dfar |
Minimum size of a node |