11#include <dolfinx/graph/AdjacencyList.h>
32 std::span<const std::int32_t> entity_indices);
41 const BoundingBoxTree& tree1);
50graph::AdjacencyList<std::int32_t>
60 const BoundingBoxTree& tree,
61 const std::array<double, 3>& point);
73std::vector<std::int32_t>
75 const BoundingBoxTree& midpoint_tree,
76 const mesh::Mesh& mesh, std::span<const double> points);
84 std::span<const double, 3> x);
96 std::span<const std::int32_t> entities,
97 std::span<const double> points);
112 std::span<const std::int32_t> entities,
113 std::span<const double> points);
127 const mesh::Mesh& mesh,
128 const graph::AdjacencyList<std::int32_t>& candidate_cells,
129 std::span<const double> points);
145std::tuple<std::vector<std::int32_t>, std::vector<std::int32_t>,
146 std::vector<double>, std::vector<std::int32_t>>
148 std::span<const double> points);
Geometry data structures and algorithms.
Definition: BoundingBoxTree.h:24
std::vector< double > squared_distance(const mesh::Mesh &mesh, int dim, std::span< const std::int32_t > entities, std::span< const double > points)
Compute the squared distance between a point and a mesh entity. The distance is computed between the ...
Definition: utils.cpp:462
std::vector< double > shortest_vector(const mesh::Mesh &mesh, int dim, std::span< const std::int32_t > entities, std::span< const double > points)
Compute the shortest vector from a mesh entity to a point.
Definition: utils.cpp:390
std::vector< std::int32_t > compute_collisions(const BoundingBoxTree &tree0, const BoundingBoxTree &tree1)
Compute all collisions between two BoundingBoxTrees (local to process)
Definition: utils.cpp:276
std::tuple< std::vector< std::int32_t >, std::vector< std::int32_t >, std::vector< double >, std::vector< std::int32_t > > determine_point_ownership(const mesh::Mesh &mesh, std::span< const double > points)
Given a set of points (local on each process) which process is colliding, using the GJK algorithm on ...
Definition: utils.cpp:548
std::vector< std::int32_t > compute_closest_entity(const BoundingBoxTree &tree, const BoundingBoxTree &midpoint_tree, const mesh::Mesh &mesh, std::span< const double > points)
Compute closest mesh entity to a point.
Definition: utils.cpp:316
graph::AdjacencyList< std::int32_t > compute_colliding_cells(const mesh::Mesh &mesh, const graph::AdjacencyList< std::int32_t > &candidate_cells, std::span< const double > points)
From a Mesh, find which cells collide with a set of points.
Definition: utils.cpp:474
BoundingBoxTree create_midpoint_tree(const mesh::Mesh &mesh, int tdim, std::span< const std::int32_t > entity_indices)
Create a bounding box tree for a subset of entities (local to process) based on the entity midpoints.
Definition: utils.cpp:254
int compute_first_colliding_cell(const mesh::Mesh &mesh, const BoundingBoxTree &tree, const std::array< double, 3 > &point)
Compute the first collision between a point and the cells of the mesh.
Definition: utils.cpp:505
double compute_squared_distance_bbox(std::span< const double, 6 > b, std::span< const double, 3 > x)
Compute squared distance between point and bounding box.
Definition: utils.cpp:367
Mesh data structures and algorithms on meshes.
Definition: DofMap.h:31