6#include <deal.II/grid/cell_id.h>
7#include <deal.II/grid/grid_tools.h>
11template <
int dim,
bool reciprocal>
14 const parallel::distributed::Triangulation<dim> &triangulation,
16 &cells_local_neighbor_list,
18 &cells_ghost_neighbor_list)
36 auto v_to_c = GridTools::vertex_to_cell_map(triangulation);
39 for (
const auto &cell : triangulation.active_cell_iterators())
42 if (cell->is_locally_owned())
45 local_neighbor_vector.push_back(cell);
47 if constexpr (!reciprocal)
48 total_cell_list.insert(cell);
50 for (
unsigned int vertex = 0; vertex < cell->n_vertices(); ++vertex)
52 for (
const auto &neighbor : v_to_c[cell->vertex_index(vertex)])
54 if (neighbor->is_locally_owned())
56 auto search_iterator = total_cell_list.find(neighbor);
57 auto local_search_iterator =
58 std::find(local_neighbor_vector.begin(),
59 local_neighbor_vector.end(),
67 if (search_iterator == total_cell_list.end() &&
68 local_search_iterator == local_neighbor_vector.end())
70 local_neighbor_vector.push_back(neighbor);
76 else if (neighbor->is_ghost())
78 auto ghost_search_iterator =
79 std::find(ghost_neighbor_vector.begin(),
80 ghost_neighbor_vector.end(),
82 if (ghost_search_iterator == ghost_neighbor_vector.end())
84 if (ghost_neighbor_vector.empty())
86 ghost_neighbor_vector.push_back(cell);
89 ghost_neighbor_vector.push_back(neighbor);
95 if (!local_neighbor_vector.empty())
96 cells_local_neighbor_list.push_back(local_neighbor_vector);
97 if (!ghost_neighbor_vector.empty())
98 cells_ghost_neighbor_list.push_back(ghost_neighbor_vector);
100 local_neighbor_vector.clear();
101 ghost_neighbor_vector.clear();
108 const parallel::distributed::Triangulation<dim> &triangulation,
110 &periodic_boundaries_cells_information,
112 &cells_local_periodic_neighbor_list,
114 &cells_ghost_periodic_neighbor_list,
116 &cells_ghost_local_periodic_neighbor_list)
121 ghost_local_periodic_neighbor_vector;
133 for (
const auto &pb_cell_struct : periodic_boundaries_cells_information)
134 all_main_cell_list.insert(pb_cell_struct.second.cell);
138 auto v_to_c = GridTools::vertex_to_cell_map(triangulation);
141 std::map<unsigned int, std::vector<unsigned int>> coinciding_vertex_groups;
144 std::map<unsigned int, unsigned int> vertex_to_coinciding_vertex_group;
148 GridTools::collect_coinciding_vertices(triangulation,
149 coinciding_vertex_groups,
150 vertex_to_coinciding_vertex_group);
154 std::set<typename Triangulation<dim>::active_cell_iterator> processed_cells;
157 for (
const auto &pb_cell_struct : periodic_boundaries_cells_information)
159 auto &cell = pb_cell_struct.second.cell;
163 if (processed_cells.contains(cell))
167 processed_cells.insert(cell);
170 if (cell->is_locally_owned())
173 local_periodic_neighbor_vector.push_back(cell);
176 total_cell_list.insert(cell);
183 coinciding_vertex_groups,
184 vertex_to_coinciding_vertex_group,
186 periodic_neighbor_list);
188 for (
const auto &periodic_neighbor : periodic_neighbor_list)
190 if (periodic_neighbor->is_locally_owned())
194 auto search_iterator =
195 total_cell_list.find(periodic_neighbor);
204 auto local_search_iterator =
205 std::find(local_periodic_neighbor_vector.begin(),
206 local_periodic_neighbor_vector.end(),
212 if (search_iterator == total_cell_list.end() &&
213 local_search_iterator ==
214 local_periodic_neighbor_vector.end())
216 local_periodic_neighbor_vector.push_back(
220 else if (periodic_neighbor->is_ghost())
231 if (all_main_cell_list.contains(periodic_neighbor) &&
232 periodic_neighbor->id() < cell->id())
237 auto ghost_search_iterator =
238 std::find(ghost_periodic_neighbor_vector.begin(),
239 ghost_periodic_neighbor_vector.end(),
241 if (ghost_search_iterator ==
242 ghost_periodic_neighbor_vector.end())
244 if (ghost_periodic_neighbor_vector.empty())
246 ghost_periodic_neighbor_vector.push_back(cell);
249 ghost_periodic_neighbor_vector.push_back(
254 if (!local_periodic_neighbor_vector.empty())
255 cells_local_periodic_neighbor_list.push_back(
256 local_periodic_neighbor_vector);
257 if (!ghost_periodic_neighbor_vector.empty())
258 cells_ghost_periodic_neighbor_list.push_back(
259 ghost_periodic_neighbor_vector);
260 local_periodic_neighbor_vector.clear();
261 ghost_periodic_neighbor_vector.clear();
263 else if (cell->is_ghost())
271 ghost_local_periodic_neighbor_vector.push_back(cell);
278 coinciding_vertex_groups,
279 vertex_to_coinciding_vertex_group,
281 periodic_neighbor_list);
283 for (
const auto &periodic_neighbor : periodic_neighbor_list)
285 if (periodic_neighbor->is_locally_owned())
290 if (all_main_cell_list.contains(periodic_neighbor) &&
291 periodic_neighbor->id() < cell->id())
300 if (std::ranges::find(ghost_local_periodic_neighbor_vector,
301 periodic_neighbor) ==
302 ghost_local_periodic_neighbor_vector.end())
304 ghost_local_periodic_neighbor_vector.push_back(
309 if (!ghost_local_periodic_neighbor_vector.empty())
310 cells_ghost_local_periodic_neighbor_list.push_back(
311 ghost_local_periodic_neighbor_vector);
312 ghost_local_periodic_neighbor_vector.clear();
324 const parallel::distributed::Triangulation<dim> &triangulation,
326 &cells_total_neighbor_list)
328 auto v_to_c = GridTools::vertex_to_cell_map(triangulation);
331 for (
const auto &cell : triangulation.active_cell_iterators())
334 if (cell->is_locally_owned())
336 std::vector<typename Triangulation<dim>::active_cell_iterator>
337 full_neighbor_vector(0);
339 full_neighbor_vector.push_back(cell);
341 for (
unsigned int vertex = 0; vertex < cell->n_vertices(); ++vertex)
343 for (
const auto &neighbor : v_to_c[cell->vertex_index(vertex)])
345 if (neighbor->is_locally_owned())
347 auto search_iterator =
348 std::find(full_neighbor_vector.begin(),
349 full_neighbor_vector.end(),
352 if (search_iterator == full_neighbor_vector.end())
354 full_neighbor_vector.push_back(neighbor);
360 cells_total_neighbor_list.insert(
361 {cell->global_active_cell_index(), full_neighbor_vector});
369 const typename Triangulation<dim>::active_cell_iterator &cell,
370 const std::map<
unsigned int, std::vector<unsigned int>>
371 &coinciding_vertex_groups,
372 const std::map<unsigned int, unsigned int> &vertex_to_coinciding_vertex_group,
373 const std::vector<std::set<
typename Triangulation<dim>::active_cell_iterator>>
378 for (
unsigned int vertex = 0; vertex < cell->n_vertices(); ++vertex)
381 unsigned int vertex_id = cell->vertex_index(vertex);
384 if (vertex_to_coinciding_vertex_group.contains(vertex_id))
387 unsigned int coinciding_vertex_key =
388 vertex_to_coinciding_vertex_group.at(vertex_id);
391 for (
auto coinciding_vertex :
392 coinciding_vertex_groups.at(coinciding_vertex_key))
396 if (coinciding_vertex != vertex_id)
399 for (
const auto &neighbor_id : v_to_c[coinciding_vertex])
401 periodic_neighbor_list.push_back(neighbor_id);
411 const parallel::distributed::Triangulation<2> &triangulation,
417 const parallel::distributed::Triangulation<3> &triangulation,
423 const parallel::distributed::Triangulation<2> &triangulation,
429 const parallel::distributed::Triangulation<3> &triangulation,
435 const parallel::distributed::Triangulation<2> &triangulation,
437 &periodic_boundaries_cells_information,
439 &cells_local_periodic_neighbor_list,
441 &cells_ghost_periodic_neighbor_list,
443 &cells_ghost_local_periodic_neighbor_list);
447 const parallel::distributed::Triangulation<3> &triangulation,
449 &periodic_boundaries_cells_information,
451 &cells_local_periodic_neighbor_list,
453 &cells_ghost_periodic_neighbor_list,
455 &cells_ghost_local_periodic_neighbor_list);
459 const parallel::distributed::Triangulation<2> &triangulation,
464 const parallel::distributed::Triangulation<3> &triangulation,
template void find_cell_neighbors< 2, true >(const parallel::distributed::Triangulation< 2 > &triangulation, dem_data_structures< 2 >::cells_neighbor_list &cells_local_neighbor_list, dem_data_structures< 2 >::cells_neighbor_list &cells_ghost_neighbor_list)
template void find_cell_neighbors< 2, false >(const parallel::distributed::Triangulation< 2 > &triangulation, dem_data_structures< 2 >::cells_neighbor_list &cells_local_neighbor_list, dem_data_structures< 2 >::cells_neighbor_list &cells_ghost_neighbor_list)
template void find_cell_periodic_neighbors< 3 >(const parallel::distributed::Triangulation< 3 > &triangulation, const dem_data_structures< 3 >::periodic_boundaries_cells_info &periodic_boundaries_cells_information, dem_data_structures< 3 >::cells_neighbor_list &cells_local_periodic_neighbor_list, dem_data_structures< 3 >::cells_neighbor_list &cells_ghost_periodic_neighbor_list, dem_data_structures< 3 >::cells_neighbor_list &cells_ghost_local_periodic_neighbor_list)
template void find_cell_neighbors< 3, true >(const parallel::distributed::Triangulation< 3 > &triangulation, dem_data_structures< 3 >::cells_neighbor_list &cells_local_neighbor_list, dem_data_structures< 3 >::cells_neighbor_list &cells_ghost_neighbor_list)
void find_cell_periodic_neighbors(const parallel::distributed::Triangulation< dim > &triangulation, const typename dem_data_structures< dim >::periodic_boundaries_cells_info &periodic_boundaries_cells_information, typename dem_data_structures< dim >::cells_neighbor_list &cells_local_periodic_neighbor_list, typename dem_data_structures< dim >::cells_neighbor_list &cells_ghost_periodic_neighbor_list, typename dem_data_structures< dim >::cells_neighbor_list &cells_ghost_local_periodic_neighbor_list)
Finds the periodic neighbor list (without repetition) of all the active cells in the triangulation....
void get_periodic_neighbor_list(const typename Triangulation< dim >::active_cell_iterator &cell, const std::map< unsigned int, std::vector< unsigned int > > &coinciding_vertex_groups, const std::map< unsigned int, unsigned int > &vertex_to_coinciding_vertex_group, const std::vector< std::set< typename Triangulation< dim >::active_cell_iterator > > &v_to_c, typename dem_data_structures< dim >::cell_vector &periodic_neighbor_list)
Generate a periodic neighbor cells list of the cell. With the coinciding_vertex_groups and the vertex...
template void find_cell_neighbors< 3, false >(const parallel::distributed::Triangulation< 3 > &triangulation, dem_data_structures< 3 >::cells_neighbor_list &cells_local_neighbor_list, dem_data_structures< 3 >::cells_neighbor_list &cells_ghost_neighbor_list)
template void find_full_cell_neighbors< 2 >(const parallel::distributed::Triangulation< 2 > &triangulation, dem_data_structures< 2 >::cells_total_neighbor_list &cells_total_neighbor_list)
void find_full_cell_neighbors(const parallel::distributed::Triangulation< dim > &triangulation, typename dem_data_structures< dim >::cells_total_neighbor_list &cells_total_neighbor_list)
Finds the full neighbor list (with repetition) of all the active cells in the triangulation....
template void find_full_cell_neighbors< 3 >(const parallel::distributed::Triangulation< 3 > &triangulation, dem_data_structures< 3 >::cells_total_neighbor_list &cells_total_neighbor_list)
template void find_cell_periodic_neighbors< 2 >(const parallel::distributed::Triangulation< 2 > &triangulation, const dem_data_structures< 2 >::periodic_boundaries_cells_info &periodic_boundaries_cells_information, dem_data_structures< 2 >::cells_neighbor_list &cells_local_periodic_neighbor_list, dem_data_structures< 2 >::cells_neighbor_list &cells_ghost_periodic_neighbor_list, dem_data_structures< 2 >::cells_neighbor_list &cells_ghost_local_periodic_neighbor_list)
void find_cell_neighbors(const parallel::distributed::Triangulation< dim > &triangulation, typename dem_data_structures< dim >::cells_neighbor_list &cells_local_neighbor_list, typename dem_data_structures< dim >::cells_neighbor_list &cells_ghost_neighbor_list)
Finds the neighbor list (without repetition) of all the active cells in the triangulation....
This namespace defines all the data containers and required operations on these containers for the DE...
std::vector< std::vector< typename Triangulation< dim >::active_cell_iterator > > cells_neighbor_list
std::unordered_multimap< types::global_cell_index, periodic_boundaries_cells_info_struct< dim > > periodic_boundaries_cells_info
ankerl::unordered_dense::map< types::global_cell_index, std::vector< typename Triangulation< dim >::active_cell_iterator > > cells_total_neighbor_list
std::set< typename Triangulation< dim >::active_cell_iterator > cell_set
std::vector< typename Triangulation< dim >::active_cell_iterator > cell_vector