for (const auto &p_unit : reference_locations)
{
if (numbers::is_finite(p_unit[0]) &&
- GeometryInfo<dim>::is_inside_unit_cell(p_unit,
- tolerance_inside_cell))
+ cell->reference_cell().contains_point(p_unit,
+ tolerance_inside_cell))
particle->set_reference_location(p_unit);
else
particles_out_of_cell.push_back(particle);
real_locations,
reference_locations);
- if (GeometryInfo<dim>::is_inside_unit_cell(reference_locations[0],
- tolerance_inside_cell))
+ if ((*candidate_cell)
+ ->reference_cell()
+ .contains_point(reference_locations[0],
+ tolerance_inside_cell))
{
current_cell = *candidate_cell;
found_cell = true;
mapping->transform_points_real_to_unit_cell(
cell, real_locations, reference_locations);
- if (GeometryInfo<dim>::is_inside_unit_cell(
+ if (cell->reference_cell().contains_point(
reference_locations[0], tolerance_inside_cell))
{
current_cell = cell;
const Point<dim> p_unit =
mapping->transform_real_to_unit_cell(
child, particle->get_location());
- if (GeometryInfo<dim>::is_inside_unit_cell(
+ if (cell->reference_cell().contains_point(
p_unit, tolerance_inside_cell))
{
found_new_cell = true;
// If we get here, we did not find the particle in any
// child. This case may happen for particles that are at the
// boundary for strongly curved cells. We apply a tolerance
- // in the call to GeometryInfo<dim>::is_inside_unit_cell to
+ // in the call to ReferenceCell::contains_point() to
// account for this, but if that is not enough, we still
// need to prevent an endless loop here. Delete the particle
// and move on.