16 #ifndef __H2D_MULTIMESH_DG_NEIGHBOR_TREE_H
17 #define __H2D_MULTIMESH_DG_NEIGHBOR_TREE_H
19 #include "multimesh_dg_neighbor_tree_node.h"
20 #include "mesh/traverse.h"
21 #include "neighbor_search.h"
29 template<
typename Scalar>
41 static void insert_into_multimesh_tree(
MultimeshDGNeighborTreeNode* node,
unsigned int* transformations,
unsigned int transformation_count);
44 static std::vector<std::vector<unsigned int>*> get_multimesh_neighbors_transformations(
MultimeshDGNeighborTreeNode* multimesh_tree);
47 static void traverse_multimesh_tree(
MultimeshDGNeighborTreeNode* node, std::vector<std::vector<unsigned int>*>& running_transformations);
61 static void traverse_multimesh_subtree(
MultimeshDGNeighborTreeNode* node, std::vector<std::vector<unsigned int>*>& running_central_transformations,
static void process_edge(NeighborSearch< Scalar > **neighbor_searches, unsigned char num_neighbor_searches, unsigned int &num_neighbors, bool *&processed)
The main method, for the passed neighbor searches, it will process all multi-mesh neighbor consolidat...
This class characterizes a neighborhood of a given edge in terms of adjacent elements and provides me...
Structure containing all the needed information about the active edge from the neighbor's side...