public recursive subroutine traverse_tree(node_pos, leVal, proto, geometry, temData, header, meshUniverse)
Recursively traverse the tree in a depth first manner to obtain the
the ordering required by treelm.
Only considere flooded nodes here, no need to traverse further down any
non flooded node, as it does not belong to the computational domain.
All virtual nodes containing at least one flooded leaf node has already
been determined and set after flooding in sdr_flood_module::sdr_flood_tree.
If the leaf node is reached, hand over to the ::refine_leaf routine, to
find all elements, that actually should be created in the computational
domain.
Todo
KM: Store has_boundary information for every leaf node in
sdr_refine_leaf routine to avoid excessive boundary checking far
away from the boundaries.
If this node is flooded or fluidifyable it needs to be included in the
final mesh.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.