line_mesh_utils.cpp File Reference

#include "kernel/discretization/utils/line_mesh_utils.h"
#include "kernel/discretization/edge_element.h"
#include "kernel/discretization/element_mesh_iterator.h"
#include "kernel/discretization/line_mesh.h"
#include "kernel/discretization/mesh_predicates.h"
#include "kernel/discretization/node.h"
#include "kernel/geometry/geometry_utils.h"
#include "kernel/geometry/shapes/circle.h"
#include <cmath>

Include dependency graph for line_mesh_utils.cpp:

Namespaces
namespace	kernel
namespace	kernel::numerics

Functions
const GeomPoint< 2 >	kernel::numerics::find_closest_point_to (const LineMesh< 2 > &mesh, const GeomPoint< 2 > &p, uint_t nsamples, real_t tol)
	Find the closest point on the given LineMesh The function loops over the elements in the mesh and uses samples the EdgeElement using the given number of sampling points plus two as it accounts for the vertices as well. From the calculated points it picks the one with the smallest distance.
const std::vector< GeomPoint< 2 > >	kernel::numerics::find_intersections (const LineMesh< 2 > &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.