Build a recursive inertial binary tree
| 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 |
Divide given cluster of spheres into two subclusters by inertial bisection
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=rp), | intent(in) | :: | c_particle(:,:) | |||
| integer(kind=ip), | intent(inout) | :: | order(:) | |||
| integer(kind=ip), | intent(out) | :: | div |