XFEMFuncs.h

Go to the documentation of this file.

//* This file is part of the MOOSE framework
//* https://mooseframework.inl.gov
//*
//* All rights reserved, see COPYRIGHT for full restrictions
//* https://github.com/idaholab/moose/blob/master/COPYRIGHT
//*
//* Licensed under LGPL 2.1, please see LICENSE for details
//* https://www.gnu.org/licenses/lgpl-2.1.html
 
#pragma once
 
#include <vector>
#include "libmesh/point.h"
#include "libmesh/plane.h"
#include "EFAPoint.h"
 
using namespace libMesh;
 
namespace Xfem
{
static const double tol = 1.0e-10;
 
void dunavant_rule2(const Real * wts,
                    const Real * a,
                    const Real * b,
                    const unsigned int * permutation_ids,
                    unsigned int n_wts,
                    std::vector<Point> & points,
                    std::vector<Real> & weights);
 
void stdQuadr2D(unsigned int nen, unsigned int iord, std::vector<std::vector<Real>> & sg2);
 
void wissmannPoints(unsigned int nqp, std::vector<std::vector<Real>> & wss);
 
void shapeFunc2D(unsigned int nen,
                 std::vector<Real> & ss,
                 std::vector<Point> & xl,
                 std::vector<std::vector<Real>> & shp,
                 Real & xsj,
                 bool natl_flg);
 
double r8vec_norm(int n, double a[]);
 
void r8vec_copy(int n, double a1[], double a2[]);
 
bool r8vec_eq(int n, double a1[], double a2[]);
 
double r8vec_dot_product(int n, double a1[], double a2[]);
 
bool line_exp_is_degenerate_nd(int dim_num, double p1[], double p2[]);
 
int plane_normal_line_exp_int_3d(
    double pp[3], double normal[3], double p1[3], double p2[3], double pint[3]);
 
double polyhedron_volume_3d(
    double coord[], int order_max, int face_num, int node[], int node_num, int order[]);
 
void i4vec_zero(int n, int a[]);
 
void normalizePoint(Point & p);
 
void normalizePoint(EFAPoint & p);
 
double r8_acos(double c);
 
double angle_rad_3d(double p1[3], double p2[3], double p3[3]);
 
bool intersectSegmentWithCutLine(const Point & segment_point1,
                                 const Point & segment_point2,
                                 const std::pair<Point, Point> & cutting_line_points,
                                 const Real & cutting_line_fraction,
                                 Real & segment_intersection_fraction);
 
Real crossProduct2D(const Point & point_a, const Point & point_b);
 
Real pointSegmentDistance(const Point & x0, const Point & x1, const Point & x2, Point & xp);
 
// See "Generating Signed Distance Fields From Triangle Meshes" for details.
// (http://www2.imm.dtu.dk/pubdb/edoc/imm1289.pdf)
//
//        R1
//         1
//        *  *
//   R4  *     * R6
//     *    R0  *
//    *           *
//   2  *  * *  *  3
// R2       R5       R3
 
Real pointTriangleDistance(const Point & x0,
                           const Point & x1,
                           const Point & x2,
                           const Point & x3,
                           Point & xp,
                           unsigned int & region);
 
bool intersectWithEdge(const Point & p1,
                       const Point & p2,
                       const std::vector<Point> & vertices,
                       Point & pint);
 
bool isInsideEdge(const Point & p1, const Point & p2, const Point & p);
 
Real getRelativePosition(const Point & p1, const Point & p2, const Point & p);
 
bool isInsideCutPlane(const std::vector<Point> & vertices, const Point & p);
 
} // namespace Xfem