compute_intersections.h File Reference

#include <deal.II/base/config.h>
#include <deal.II/base/function_lib.h>
#include <deal.II/base/quadrature.h>
#include <deal.II/fe/mapping.h>
#include <deal.II/fe/mapping_q1.h>
#include <deal.II/grid/grid_tools.h>
#include <deal.II/grid/grid_tools_cache.h>
#include <deal.II/grid/tria.h>
#include <set>
#include <tuple>
#include <vector>

Include dependency graph for compute_intersections.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
	dealii
	dealii::NonMatching

Functions
template<int dim0, int dim1, int spacedim>
Quadrature< spacedim >	dealii::NonMatching::compute_intersection (const typename Triangulation< dim0, spacedim >::cell_iterator &cell0, const typename Triangulation< dim1, spacedim >::cell_iterator &cell1, const unsigned int degree, const Mapping< dim0, spacedim > &mapping0=(ReferenceCells::get_hypercube< dim0 >() .template get_default_linear_mapping< dim0, spacedim >()), const Mapping< dim1, spacedim > &mapping1=(ReferenceCells::get_hypercube< dim1 >() .template get_default_linear_mapping< dim1, spacedim >()))
	Intersect cell0 and cell1 and construct a Quadrature<spacedim> of degree degreeover the intersection, i.e. More...
template<int dim0, int dim1, int spacedim>
std::vector< std::tuple< typename Triangulation< dim0, spacedim >::cell_iterator, typename Triangulation< dim1, spacedim >::cell_iterator, Quadrature< spacedim > > >	dealii::NonMatching::compute_intersection (const GridTools::Cache< dim0, spacedim > &space_cache, const GridTools::Cache< dim1, spacedim > &immersed_cache, const unsigned int degree, const double tol=0.)
	Given two triangulations cached inside GridTools::Cache objects, compute all intersections between the two and return a vector where each entry is a tuple containing iterators to the respective cells and a Quadrature<spacedim> formula to integrate over the intersection. More...