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 <cstdint>
#include <dolfinx/graph/AdjacencyList.h>
#include <span>
#include <vector>
 
namespace dolfinx::mesh
{
class Mesh;
}
 
namespace dolfinx::geometry
{
class BoundingBoxTree;
 
BoundingBoxTree
create_midpoint_tree(const mesh::Mesh& mesh, int tdim,
                     const std::span<const std::int32_t>& entity_indices);
 
std::vector<std::array<int, 2>>
compute_collisions(const BoundingBoxTree& tree0, const BoundingBoxTree& tree1);
 
graph::AdjacencyList<std::int32_t>
compute_collisions(const BoundingBoxTree& tree,
                   const std::span<const double>& points);
 
std::vector<std::int32_t> compute_closest_entity(
    const BoundingBoxTree& tree, const BoundingBoxTree& midpoint_tree,
    const mesh::Mesh& mesh, const std::span<const double>& points);
 
double
compute_squared_distance_bbox(const std::array<std::array<double, 3>, 2>& b,
                              const std::array<double, 3>& x);
 
std::vector<double>
shortest_vector(const mesh::Mesh& mesh, int dim,
                const std::span<const std::int32_t>& entities,
                const std::span<const double>& points);
 
std::vector<double>
squared_distance(const mesh::Mesh& mesh, int dim,
                 const std::span<const std::int32_t>& entities,
                 const std::span<const double>& points);
 
graph::AdjacencyList<int> compute_colliding_cells(
    const mesh::Mesh& mesh,
    const graph::AdjacencyList<std::int32_t>& candidate_cells,
    const std::span<const double>& points);
} // namespace dolfinx::geometry