This routine checks for boundary neighbors and level of the boundary node

Note, this can not easily be used for target nodes with subelement resolution, as it assumes q-Values if the node is intersected by a boundary.

Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|

integer, | intent(in) | :: | node_pos | Position of leaf in the preliminary tree |
||

integer(kind=long_k), | intent(in) | :: | treeID | treeID of parent node |
||

integer, | intent(in) | :: | coord(4) | Coordinate of treeID |
||

type(levelValues_type), | intent(in) | :: | leVal | level value of parent node |
||

type(sdr_protoTree_type), | intent(in) | :: | proto | preliminary tree |
||

type(sdr_geometry_type), | intent(in) | :: | geometry | contains all geometrical objects |
||

integer(kind=long_k), | intent(out) | :: | BC_ID(qQQQ) | Boundary ID for all 26 neighbor directions |
||

real(kind=rk), | intent(out) | :: | qVal(qQQQ) | distance from boundary for all 26 neighbor directions |
||

type(treelmesh_type), | intent(in) | :: | meshUniverse | contains bounding cube information |

Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|

integer, | private | :: | iDir | ||||

integer, | private | :: | neighbor_pos | ||||

integer, | private | :: | neighbor_level | ||||

logical, | private | :: | unKnownBnd(qQQQ) | ||||

integer, | private | :: | startDir | ||||

integer, | private | :: | unKnownNeighPos(qQQQ) | ||||

real(kind=rk), | private | :: | elembary(3) | ||||

integer(kind=long_k), | private | :: | minBCID | ||||

logical, | private | :: | check_unKnownBnd | ||||

integer, | private | :: | iDir_tmp | ||||

integer, | private | :: | nBCs |