38 template <
int dim,
int spacedim>
40 const double tolerance,
41 const bool enforce_unique_mapping,
42 const unsigned int rtree_level,
43 const std::function<std::vector<bool>()> &marked_vertices)
44 : tolerance(tolerance)
45 , enforce_unique_mapping(enforce_unique_mapping)
46 , rtree_level(rtree_level)
47 , marked_vertices(marked_vertices)
53 template <
int dim,
int spacedim>
56 if (tria_signal.connected())
57 tria_signal.disconnect();
62 template <
int dim,
int spacedim>
69 #ifndef DEAL_II_WITH_MPI
75 if (tria_signal.connected())
76 tria_signal.disconnect();
79 tria.
signals.any_change.connect([&]() { this->ready_flag =
false; });
81 std::vector<BoundingBox<spacedim>> local_boxes;
82 for (
const auto &cell :
87 const auto local_tree =
pack_rtree(local_boxes);
90 std::vector<std::vector<BoundingBox<spacedim>>> global_bboxes(1);
100 marked_vertices ? marked_vertices() : std::vector<bool>(),
103 enforce_unique_mapping);
111 template <
int dim,
int spacedim>
115 DistributedComputePointLocationsInternal<dim, spacedim> &data,
120 this->mapping = &mapping;
122 this->recv_ranks = data.recv_ranks;
123 this->recv_ptrs = data.recv_ptrs;
125 this->send_ranks = data.send_ranks;
126 this->send_ptrs = data.send_ptrs;
128 this->recv_permutation = {};
129 this->recv_permutation.resize(data.recv_components.size());
130 this->point_ptrs.assign(data.n_searched_points + 1, 0);
131 for (
unsigned int i = 0; i < data.recv_components.size(); ++i)
134 this->recv_permutation.size());
135 this->recv_permutation[std::get<2>(data.recv_components[i])] = i;
138 this->point_ptrs.size());
139 this->point_ptrs[std::get<1>(data.recv_components[i]) + 1]++;
142 std::tuple<unsigned int, unsigned int> n_owning_processes_default{
144 std::tuple<unsigned int, unsigned int> n_owning_processes_local =
145 n_owning_processes_default;
147 for (
unsigned int i = 0; i < data.n_searched_points; ++i)
149 std::get<0>(n_owning_processes_local) =
150 std::min(std::get<0>(n_owning_processes_local),
151 this->point_ptrs[i + 1]);
152 std::get<1>(n_owning_processes_local) =
154 this->point_ptrs[i + 1]);
156 this->point_ptrs[i + 1] += this->point_ptrs[i];
159 const auto n_owning_processes_global =
160 Utilities::MPI::all_reduce<std::tuple<unsigned int, unsigned int>>(
161 n_owning_processes_local,
164 const auto &
b) -> std::tuple<unsigned int, unsigned int> {
165 if (a == n_owning_processes_default)
168 if (
b == n_owning_processes_default)
171 return std::tuple<unsigned int, unsigned int>{
172 std::min(std::get<0>(a), std::get<0>(
b)),
173 std::max(std::get<1>(a), std::get<1>(
b))};
176 if (n_owning_processes_global == n_owning_processes_default)
178 unique_mapping =
true;
179 all_points_found_flag =
true;
183 unique_mapping = (std::get<0>(n_owning_processes_global) == 1) &&
184 (std::get<1>(n_owning_processes_global) == 1);
185 all_points_found_flag = std::get<0>(n_owning_processes_global) > 0;
188 Assert(enforce_unique_mapping ==
false || unique_mapping,
191 cell_data = std::make_unique<CellData>(
tria);
192 send_permutation = {};
194 std::pair<int, int> dummy{-1, -1};
195 for (
const auto &i : data.send_components)
197 if (dummy != std::get<0>(i))
199 dummy = std::get<0>(i);
200 cell_data->cells.emplace_back(dummy);
201 cell_data->reference_point_ptrs.emplace_back(
202 cell_data->reference_point_values.size());
205 cell_data->reference_point_values.emplace_back(std::get<3>(i));
206 send_permutation.emplace_back(std::get<5>(i));
209 cell_data->reference_point_ptrs.emplace_back(
210 cell_data->reference_point_values.size());
212 this->ready_flag =
true;
217 template <
int dim,
int spacedim>
225 template <
int dim,
int spacedim>
229 return {0,
static_cast<unsigned int>(cells.size())};
234 template <
int dim,
int spacedim>
237 const unsigned int cell)
const
240 return {&
triangulation, cells[cell].first, cells[cell].second};
245 template <
int dim,
int spacedim>
248 const unsigned int cell)
const
251 return {reference_point_values.data() + reference_point_ptrs[cell],
252 reference_point_ptrs[cell + 1] - reference_point_ptrs[cell]};
257 template <
int dim,
int spacedim>
266 template <
int dim,
int spacedim>
267 const std::vector<unsigned int> &
275 template <
int dim,
int spacedim>
284 template <
int dim,
int spacedim>
293 template <
int dim,
int spacedim>
296 const unsigned int i)
const
308 template <
int dim,
int spacedim>
317 template <
int dim,
int spacedim>
326 template <
int dim,
int spacedim>
336 #include "mpi_remote_point_evaluation.inst"
virtual BoundingBox< spacedim > get_bounding_box(const typename Triangulation< dim, spacedim >::cell_iterator &cell) const
virtual MPI_Comm get_communicator() const
std_cxx20::ranges::iota_view< unsigned int, unsigned int > cell_indices() const
ArrayView< const Point< dim > > get_unit_points(const unsigned int cell) const
Triangulation< dim, spacedim >::active_cell_iterator get_active_cell_iterator(const unsigned int cell) const
RemotePointEvaluation(const double tolerance=1e-6, const bool enforce_unique_mapping=false, const unsigned int rtree_level=0, const std::function< std::vector< bool >()> &marked_vertices={})
std::unique_ptr< CellData > cell_data
bool all_points_found() const
std::vector< unsigned int > point_ptrs
const Triangulation< dim, spacedim > & get_triangulation() const
SmartPointer< const Mapping< dim, spacedim > > mapping
const std::vector< unsigned int > & get_point_ptrs() const
bool is_map_unique() const
const Mapping< dim, spacedim > & get_mapping() const
const CellData & get_cell_data() const
bool all_points_found_flag
SmartPointer< const Triangulation< dim, spacedim > > tria
bool point_found(const unsigned int i) const
#define DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_CLOSE
IteratorRange< active_cell_iterator > active_cell_iterators() const
static ::ExceptionBase & ExcInternalError()
static ::ExceptionBase & ExcNeedsMPI()
#define Assert(cond, exc)
#define AssertIndexRange(index, range)
SymmetricTensor< 2, dim, Number > b(const Tensor< 2, dim, Number > &F)
void reinit(MatrixBlock< MatrixType > &v, const BlockSparsityPattern &p)
static const unsigned int invalid_unsigned_int
boost::integer_range< IncrementableType > iota_view
const ::parallel::distributed::Triangulation< dim, spacedim > * triangulation
std::vector< BoundingBox< boost::geometry::dimension< typename Rtree::indexable_type >::value > > extract_rtree_level(const Rtree &tree, const unsigned int level)
RTree< typename LeafTypeIterator::value_type, IndexType, IndexableGetter > pack_rtree(const LeafTypeIterator &begin, const LeafTypeIterator &end)
const ::Triangulation< dim, spacedim > & tria