intersections.h

Go to the documentation of this file.

// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 2022 - 2024 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
 
#ifndef dealii_cgal_intersections_h
#define dealii_cgal_intersections_h
 
#include <deal.II/base/config.h>
 
#include <deal.II/base/array_view.h>
#include <deal.II/base/point.h>
 
#include <deal.II/fe/mapping.h>
 
#include <deal.II/grid/tria.h>
 
 
DEAL_II_NAMESPACE_OPEN
namespace CGALWrappers
{
  template <int structdim0, int structdim1, int spacedim>
  std::vector<std::array<Point<spacedim>, structdim1 + 1>>
  compute_intersection_of_cells(
    const typename Triangulation<structdim0, spacedim>::cell_iterator &cell0,
    const typename Triangulation<structdim1, spacedim>::cell_iterator &cell1,
    const Mapping<structdim0, spacedim>                               &mapping0,
    const Mapping<structdim1, spacedim>                               &mapping1,
    const double tol = 1e-9);
 
 
  template <int structdim0, int structdim1, int spacedim>
  std::vector<std::array<Point<spacedim>, structdim1 + 1>>
  compute_intersection_of_cells(
    const ArrayView<const Point<spacedim>> &vertices0,
    const ArrayView<const Point<spacedim>> &vertices1,
    const double                            tol = 1e-9);
 
} // namespace CGALWrappers
 
DEAL_II_NAMESPACE_CLOSE
 
#endif