29 const std::vector<dof_id_type> & trial_primary_nodes,
30 const std::map<
dof_id_type, std::vector<dof_id_type>> & node_to_elem_map,
31 const unsigned int patch_size,
const std::vector< dof_id_type > & _trial_primary_nodes
Nodes to search against.
void join(const SecondaryNeighborhoodThread &other)
const std::map< dof_id_type, std::vector< dof_id_type > > & _node_to_elem_map
Node to elem map.
SecondaryNeighborhoodThread(const MooseMesh &mesh, const std::vector< dof_id_type > &trial_primary_nodes, const std::map< dof_id_type, std::vector< dof_id_type >> &node_to_elem_map, const unsigned int patch_size, KDTree &_kd_tree)
Finds the nearest node to each node in boundary1 to each node in boundary2 and the other way around...
void operator()(const NodeIdRange &range)
Save a patch of nodes that are close to each of the secondary nodes to speed the search algorithm TOD...
std::map< dof_id_type, std::vector< dof_id_type > > _neighbor_nodes
The neighborhood nodes associated with each node.
MooseMesh wraps a libMesh::Mesh object and enhances its capabilities by caching additional data and s...
std::set< dof_id_type > _ghosted_elems
Elements that we need to ghost.
unsigned int _patch_size
The number of nodes to keep.
const MooseMesh & _mesh
The Mesh.
std::vector< dof_id_type > _secondary_nodes
List of the secondary nodes we're actually going to keep track of.