utils.h

// Copyright (C) 2019-2021 Garth N. Wells and Jørgen S. Dokken
//
// This file is part of DOLFINx (https://www.fenicsproject.org)
//
// SPDX-License-Identifier:    LGPL-3.0-or-later
 
#pragma once
 
#include <array>
#include <utility>
#include <vector>
#include <xtl/xspan.hpp>
 
namespace dolfinx
{
namespace mesh
{
class Mesh;
} // namespace mesh
 
namespace geometry
{
class BoundingBoxTree;
 
BoundingBoxTree
create_midpoint_tree(const mesh::Mesh& mesh, int tdim,
                     const xtl::span<const std::int32_t>& entity_indices);
 
std::vector<std::array<int, 2>>
compute_collisions(const BoundingBoxTree& tree0, const BoundingBoxTree& tree1);
 
std::vector<int> compute_collisions(const BoundingBoxTree& tree,
                                    const std::array<double, 3>& p);
 
std::pair<std::int32_t, double>
compute_closest_entity(const BoundingBoxTree& tree,
                       const std::array<double, 3>& p, const mesh::Mesh& mesh,
                       double R = -1);
 
double
compute_squared_distance_bbox(const std::array<std::array<double, 3>, 2>& b,
                              const std::array<double, 3>& x);
 
double squared_distance(const mesh::Mesh& mesh, int dim, std::int32_t index,
                        const std::array<double, 3>& p);
 
std::vector<std::int32_t>
select_colliding_cells(const dolfinx::mesh::Mesh& mesh,
                       const xtl::span<const std::int32_t>& candidate_cells,
                       const std::array<double, 3>& p, int n);
} // namespace geometry
} // namespace dolfinx