nearest_point.cpp File Reference

#include <meltpooldg/level_set/nearest_point.hpp>
#include <deal.II/base/exceptions.h>
#include <deal.II/base/mpi.templates.h>
#include <deal.II/base/mpi_noncontiguous_partitioner.templates.h>
#include <deal.II/base/quadrature.h>
#include <deal.II/base/tensor.h>
#include <deal.II/fe/fe_update_flags.h>
#include <deal.II/fe/fe_values.h>
#include <deal.II/grid/grid_tools.h>
#include <deal.II/grid/grid_tools_geometry.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/numerics/rtree.h>
#include <deal.II/numerics/vector_tools_evaluate.h>
#include <meltpooldg/cut/util.hpp>
#include <meltpooldg/utilities/conditional_ostream.hpp>
#include <meltpooldg/utilities/journal.hpp>
#include <meltpooldg/utilities/scoped_name.hpp>
#include <meltpooldg/utilities/utility_functions.hpp>
#include <boost/geometry/index/rtree.hpp>
#include <algorithm>
#include <array>
#include <cmath>
#include <fstream>
#include <iostream>
#include <memory>
#include <numeric>
#include <sstream>

Include dependency graph for nearest_point.cpp:

Namespaces
namespace	MeltPoolDG
	Interface for a general preconditioner.
namespace	MeltPoolDG::LevelSet
	This operation solves the reinitialization problem for a CG- or DG-FEM-based discrete level-set field by solving an elliptic problem.
namespace	MeltPoolDG::LevelSet::Tools