10#include <deal.II/distributed/tria.h>
12#include <deal.II/grid/grid_generator.h>
13#include <deal.II/grid/grid_tools.h>
14#include <deal.II/grid/tria.h>
16#include <boost/range/adaptor/map.hpp>
27 const parallel::distributed::Triangulation<dim> &triangulation,
29 const std::set<types::boundary_id> &outlet_boundaries,
30 const bool &check_diamond_cells,
31 const bool &expand_particle_wall_contact_search,
32 const ConditionalOStream &pcout)
43 const double maximal_cell_diameter =
44 GridTools::maximal_cell_diameter(triangulation);
53 floating_wall_properties,
54 maximal_cell_diameter);
62 if (expand_particle_wall_contact_search)
67 <<
"Warning: expansion of particle-wall contact list is enabled. "
69 <<
"This feature is only useful in geometries with convex boundaries."
85 <<
"Warning: expansion of particle-wall contact list is disabled. "
87 <<
"This feature is useful in geometries with convex boundaries. "
97 const parallel::distributed::Triangulation<dim> &triangulation,
98 const std::set<types::boundary_id> &outlet_boundaries,
99 const bool &check_diamond_cells,
100 const ConditionalOStream &pcout)
129 const parallel::distributed::Triangulation<dim> &triangulation,
130 const std::set<types::boundary_id> &outlet_boundaries)
138 std::vector<std::pair<int, typename Triangulation<dim>::active_cell_iterator>>
143 const FE_Q<dim> fe(1);
144 QGauss<dim - 1> face_quadrature_formula(1);
145 FEFaceValues<dim> fe_face_values(fe,
146 face_quadrature_formula,
147 update_values | update_quadrature_points |
148 update_normal_vectors);
151 for (
const auto &cell : triangulation.active_cell_iterators())
154 for (
const auto &face : cell->face_iterators())
158 const int face_id = cell->face_iterator_to_index(face);
159 const bool is_outlet =
160 outlet_boundaries.contains(face->boundary_id());
161 const bool is_periodic = cell->has_periodic_neighbor(face_id);
163 if (!is_outlet && !is_periodic)
166 if (face->at_boundary())
168 fe_face_values.reinit(cell, face_id);
171 Tensor<1, dim> normal_vector =
172 -fe_face_values.normal_vector(0);
175 Point<dim> quad_point = fe_face_values.quadrature_point(0);
178 unsigned int global_face_id = cell->face_index(face_id);
183 boundary_information.
cell = cell;
184 boundary_information.
boundary_id = face->boundary_id();
194 auto information_search_element =
195 std::make_pair(face_id, cell);
196 auto search_iterator = std::find(search_vector.begin(),
198 information_search_element);
199 if (search_iterator == search_vector.end())
201 if (cell->is_locally_owned())
204 {global_face_id, boundary_information});
206 search_vector.push_back(information_search_element);
209 {global_face_id, boundary_information});
226 &new_boundary_points_and_normal_vectors)
234 const FE_Q<dim> fe(1);
235 QGauss<dim - 1> face_quadrature_formula(1);
236 FEFaceValues<dim> fe_face_values(fe,
237 face_quadrature_formula,
238 update_values | update_quadrature_points |
239 update_normal_vectors);
242 if (cell->is_locally_owned())
245 for (
const auto &face : cell->face_iterators())
248 if (face->at_boundary())
250 int face_id = cell->face_iterator_to_index(face);
251 fe_face_values.reinit(cell, face_id);
254 Tensor<1, 3> normal_vector;
256 if constexpr (dim == 3)
257 normal_vector = -fe_face_values.normal_vector(0);
259 if constexpr (dim == 2)
266 if constexpr (dim == 3)
267 quad_point = fe_face_values.quadrature_point(0);
269 if constexpr (dim == 2)
273 new_boundary_points_and_normal_vectors[cell->face_index(
274 face_id)] = std::make_pair(normal_vector, quad_point);
286 const parallel::distributed::Triangulation<dim> &triangulation)
297 std::unordered_map<std::string,
298 std::unordered_map<types::global_dof_index,
299 std::pair<Point<dim>, Point<dim>>>>
300 all_cells_with_boundary_lines;
303 for (
const auto &cell : triangulation.active_cell_iterators())
305 if (cell->is_locally_owned())
308 for (
const auto &face : cell->face_iterators())
311 if (!face->at_boundary())
315 for (
unsigned int l = 0; l < face->n_lines(); ++l)
317 if (face->line(l)->at_boundary())
319 all_cells_with_boundary_lines[cell->id()
323 std::make_pair(face->line(l)->vertex(0),
324 face->line(l)->vertex(1)));
335 if (!all_cells_with_boundary_lines.empty())
337 for (
const auto &cell : triangulation.active_cell_iterators())
339 if (cell->is_locally_owned())
341 for (
const auto &face : cell->face_iterators())
344 if (face->at_boundary())
346 for (
unsigned int l = 0; l < face->n_lines(); ++l)
348 all_cells_with_boundary_lines[cell->id()
350 .erase(face->line_index(l));
360 if (!all_cells_with_boundary_lines.empty())
362 for (
const auto &cell : triangulation.active_cell_iterators())
364 if (cell->is_locally_owned())
366 std::string cell_id_string = cell->id().to_string();
367 std::unordered_map<types::global_dof_index,
368 std::pair<Point<dim>, Point<dim>>>
369 &cell_boundary_lines =
370 all_cells_with_boundary_lines[cell_id_string];
372 if (!cell_boundary_lines.empty())
374 for (
auto &map_iterator : cell_boundary_lines)
376 Point<3> vertex_one, vertex_two;
378 if constexpr (dim == 3)
380 vertex_one = map_iterator.second.first;
381 vertex_two = map_iterator.second.second;
384 if constexpr (dim == 2)
412 std::set<unsigned int> boundary_vertices;
413 for (
const auto &face : triangulation.active_face_iterators())
415 if (face->at_boundary())
417 for (
unsigned int v = 0; v < face->n_vertices(); ++v)
419 boundary_vertices.insert(face->vertex_index(v));
427 for (
const auto &cell : triangulation.active_cell_iterators())
429 if (cell->is_locally_owned() && !cell->has_boundary_lines())
431 for (
const auto &face : cell->face_iterators())
433 if (!face->at_boundary())
435 for (
unsigned int v = 0; v < face->n_vertices(); ++v)
437 if (boundary_vertices.contains(face->vertex_index(v)))
441 if constexpr (dim == 3)
442 vertex = face->vertex(v);
444 if constexpr (dim == 2)
448 cell->id().to_string(),
461 const parallel::distributed::Triangulation<dim> &triangulation,
462 const std::set<types::boundary_id> &outlet_boundaries)
465 for (
const auto &cell : triangulation.active_cell_iterators())
468 for (
const auto &face : cell->face_iterators())
472 if (!outlet_boundaries.contains(face->boundary_id()))
475 if (face->at_boundary())
487 const parallel::distributed::Triangulation<dim> &triangulation,
488 const std::set<types::boundary_id> &outlet_boundaries,
489 const bool &check_diamond_cells,
490 const ConditionalOStream &pcout)
492 std::vector<typename Triangulation<dim>::active_cell_iterator>
493 boundary_neighbor_cells;
507 std::vector<typename Triangulation<dim>::active_cell_iterator>
509 GridTools::get_active_neighbors<Triangulation<dim>>(
510 cell_with_boundary_line, active_neighbors);
514 boundary_neighbor_cells.clear();
515 for (
auto &neighbor : active_neighbors)
521 boundary_neighbor_cells.push_back(neighbor);
527 for (
unsigned int counter_one = 0;
528 counter_one < boundary_neighbor_cells.size();
531 for (
unsigned int counter_two = 0;
532 counter_two < boundary_neighbor_cells.size();
535 if (counter_one > counter_two)
538 const typename Triangulation<dim>::active_cell_iterator
539 &cell_one = boundary_neighbor_cells[counter_one];
540 const typename Triangulation<dim>::active_cell_iterator
541 &cell_two = boundary_neighbor_cells[counter_two];
544 for (
const auto &face_one : cell_one->face_iterators())
546 for (
const auto &face_two :
547 cell_two->face_iterators())
550 if (face_one->at_boundary() &&
551 face_two->at_boundary())
553 unsigned int face_id_one, face_id_two;
555 cell_one->face_iterator_to_index(face_one);
557 cell_two->face_iterator_to_index(face_two);
561 const bool face_one_is_wall =
562 (!outlet_boundaries.contains(
563 face_one->boundary_id()) &&
564 !cell_one->has_periodic_neighbor(
566 const bool face_two_is_wall =
567 (!outlet_boundaries.contains(
568 face_two->boundary_id()) &&
569 !cell_two->has_periodic_neighbor(
572 if (face_one_is_wall && face_two_is_wall)
575 Tensor<1, dim> normal_vector_one,
579 .at(cell_one->face_index(face_id_one))
584 .at(cell_two->face_index(face_id_two))
590 if (normal_vector_one *
598 <<
"Warning: Diamond-shaped cells were detected in the input triangulation. These cells have a vertex or edge shared with a wall, but not a face. It is strongly recommended to use a triangulation without such cells. If you wish to include them in the particle-wall contact list, set check_diamond_cells = true in the .prm file. Note: these cells are not detected when grid motion is enabled."
604 if (check_diamond_cells &&
605 cell_with_boundary_line
606 ->is_locally_owned())
618 int imaginary_face_id =
619 -1 * cell_two->face_index(
625 imaginary_information =
627 .at(cell_two->face_index(
629 imaginary_information.
cell =
630 cell_with_boundary_line;
631 imaginary_information
637 imaginary_information});
655 const parallel::distributed::Triangulation<dim> &triangulation,
657 const double maximum_cell_diameter)
660 std::vector<Point<dim>> point_on_wall =
662 std::vector<Tensor<1, dim>> wall_normal_vector =
664 unsigned int floating_wall_number =
668 for (
unsigned int floating_wall_id = 0;
669 floating_wall_id < floating_wall_number;
673 for (
const auto &cell : triangulation.active_cell_iterators())
676 if (cell->is_locally_owned())
679 for (
unsigned int vertex = 0; vertex < cell->n_vertices();
683 Tensor<1, dim> connecting_vector =
684 cell->vertex(vertex) - point_on_wall[floating_wall_id];
685 double vertex_wall_distance =
686 connecting_vector * wall_normal_vector[floating_wall_id];
691 if (abs(vertex_wall_distance) < maximum_cell_diameter)
705 const parallel::distributed::Triangulation<dim> &triangulation,
706 const std::set<types::boundary_id> &outlet_boundaries,
717 std::map<int, boundary_cells_info_struct<dim>> imaginary_boundary_faces;
720 std::vector<std::set<typename Triangulation<dim>::active_cell_iterator>>
721 v_to_c = GridTools::vertex_to_cell_map(triangulation);
723 for (
auto &&boundary_cell_info :
730 TriaIterator<TriaAccessor<dim - 1, dim, dim>> main_face_iterator;
731 bool has_boundary_face =
false;
733 for (
const unsigned int face_id : boundary_cell_info.cell->face_indices())
738 if (boundary_cell_info.cell->face_index(face_id) ==
739 boundary_cell_info.global_face_id)
741 main_face_iterator = boundary_cell_info.cell->face(face_id);
742 has_boundary_face =
true;
747 Assert(has_boundary_face,
748 ExcMessage(
"Boundary face not found in boundary cell."));
751 for (
auto vertex_id : main_face_iterator->vertex_indices())
754 for (
const auto &neighboring_cell :
755 v_to_c[main_face_iterator->vertex_index(vertex_id)])
758 for (
const auto &neighboring_face :
759 neighboring_cell->face_iterators())
762 if (!neighboring_face->at_boundary())
767 const unsigned int face_id =
768 neighboring_cell->face_iterator_to_index(neighboring_face);
770 const bool face_is_wall =
771 (!outlet_boundaries.contains(
772 neighboring_face->boundary_id()) &&
773 !neighboring_cell->has_periodic_neighbor(face_id));
783 &boundary_neighbor_info =
785 neighboring_cell->face_index(face_id));
789 bool share_edge =
false;
790 unsigned int common_vertices = 0;
794 for (
auto main_vertex_id :
795 main_face_iterator->vertex_indices())
796 for (
auto neighbor_vertex_id :
797 neighboring_face->vertex_indices())
798 if (main_face_iterator->vertex_index(main_vertex_id) ==
799 neighboring_face->vertex_index(neighbor_vertex_id))
806 if constexpr (dim == 2)
807 share_edge = (common_vertices == 1);
808 else if constexpr (dim == 3)
809 share_edge = (common_vertices == 2);
818 const auto normal_1 = -boundary_cell_info.normal_vector;
821 const auto &point_1 = boundary_cell_info.point_on_face;
825 Tensor<1, dim> vector_main_to_neighbor = point_2 - point_1;
826 vector_main_to_neighbor /= vector_main_to_neighbor.norm();
827 const double tolerance = 1e-12;
832 const bool is_convex =
833 (normal_1 * vector_main_to_neighbor) < -tolerance;
850 int imaginary_face_id =
851 static_cast<int>(-0.5 *
852 (boundary_cell_info.global_face_id +
854 (boundary_cell_info.global_face_id +
863 boundary_neighbor_info;
864 boundary_information.
cell = boundary_cell_info.cell;
866 imaginary_boundary_faces.insert(
867 {imaginary_face_id, boundary_information});
static DEMActionManager * get_action_manager()
Getter of the unique instance of the DEMActionManager.
Parameters for floating walls in DEM simulations.
std::vector< Point< dim > > points_on_walls
A point on each floating wall surface.
std::vector< Tensor< 1, dim > > floating_walls_normal_vectors
Outward normal vector of each floating wall.
unsigned int floating_walls_number
Number of floating walls.
ankerl::unordered_dense::map< global_face_id, std::pair< Tensor< 1, 3 >, Point< 3 > > > boundary_points_and_normal_vectors
Handle the information related to the boundary cells which will be used for particle-wall contact det...
unsigned int global_face_id
Triangulation< dim >::active_cell_iterator cell
types::boundary_id boundary_id
Tensor< 1, dim > normal_vector
Point< dim > point_on_face
Handle information related to the cell-line matching.
Handle information related to the cell-point matching.
Tensor< 1, 3 > tensor_nd_to_3d(const Tensor< 1, dim > &tensor)
Point< 3 > point_nd_to_3d(const Point< dim > &point)