mesh_utils.h File Reference

#include "kernel/discretization/element_mesh_iterator.h"
#include "kernel/discretization/mesh_predicates.h"
#include "kernel/geometry/geometry_utils.h"
#include "kernel/geometry/shapes/circle.h"
#include <limits>
#include <tuple>
#include <vector>

Include dependency graph for mesh_utils.h:

Go to the source code of this file.

Namespaces
namespace	kernel
namespace	kernel::discretization
namespace	kernel::discretization::utils

Functions
template<typename ElementTp >
const kernel::GeomPoint< ElementTp::dimension >	kernel::discretization::utils::find_point_on_element_closest_to (const ElementTp &element, const GeomPoint< ElementTp::dimension > &p, uint_t nsamples, real_t tol)
template<typename ElementTp >
real_t	kernel::discretization::utils::distance_from (const ElementTp &element, const GeomPoint< ElementTp::dimension > &p, uint_t nsamples, real_t tol)
template<typename MeshTp >
const MeshTp::element_t *	kernel::discretization::utils::find_closest_element (const MeshTp &mesh, const GeomPoint< MeshTp::dimension > &p, uint_t nsamples, real_t tol)
	Find the element in the mesh with the smallest distance from the point.
template<typename MeshTp >
std::tuple< const typename MeshTp::point_t, const typename MeshTp::element_t * >	kernel::discretization::utils::find_closest_point_to (const MeshTp &mesh, const GeomPoint< 2 > &p, uint_t nsamples, real_t tol)
template<typename MeshTp >
const std::vector< typename MeshTp::point_t >	kernel::discretization::utils::find_intersections (const MeshTp &mesh, const Circle &circle)
	Returns the intersection points of the Circle with the elements of the LineMesh. The algorithn implemented is the one described here https://stackoverflow.com/questions/1073336/circle-line-segment-collision-detection-algorithm/1084899#1084899%E2%80%8B.