#include "INTERPKERNELDefines.hxx"#include "InterpKernelException.hxx"#include "NormalizedUnstructuredMesh.hxx"#include <deque>#include <map>#include <cmath>#include <string>#include <vector>#include <algorithm>#include <iostream>#include <limits>
Include dependency graph for InterpolationUtils.hxx:
Go to the source code of this file.
Data Structures | |
| class | INTERP_KERNEL.OTT< ConnType, numPol > |
| class | INTERP_KERNEL.OTT< ConnType, ALL_C_MODE > |
| class | INTERP_KERNEL.OTT< ConnType, ALL_FORTRAN_MODE > |
| class | INTERP_KERNEL.AngleLess |
Packages | |
| package | INTERP_KERNEL |
Functions | |
| double | INTERP_KERNEL.Surf_Tri (const double *P_1, const double *P_2, const double *P_3) |
| double | INTERP_KERNEL.mon_determinant (const double *P_1, const double *P_2, const double *P_3) |
| double | INTERP_KERNEL.norme_vecteur (const double *P_1, const double *P_2) |
| std::vector< double > | INTERP_KERNEL.calcul_cos_et_sin (const double *P_1, const double *P_2, const double *P_3) |
| template<int SPACEDIM> | |
| void | INTERP_KERNEL.fillDualCellOfTri (const double *triIn, double *quadOut) |
| template<int SPACEDIM> | |
| void | INTERP_KERNEL.fillDualCellOfPolyg (const double *polygIn, int nPtsPolygonIn, double *polygOut) |
| std::vector< double > | INTERP_KERNEL.bary_poly (const std::vector< double > &V) |
| double | INTERP_KERNEL.computeTria6RefBase (const double *coeffs, const double *pos) |
| void | INTERP_KERNEL.computeWeightedCoeffsInTria6FromRefBase (const double *refCoo, double *weightedPos) |
| double | INTERP_KERNEL.computeTetra10RefBase (const double *coeffs, const double *pos) |
| void | INTERP_KERNEL.computeWeightedCoeffsInTetra10FromRefBase (const double *refCoo, double *weightedPos) |
| template<unsigned nbRow> | |
| bool | INTERP_KERNEL.solveSystemOfEquations (double M[nbRow][nbRow+1], double *sol) |
| Solve system equation in matrix form using Gaussian elimination algorithm. | |
| template<unsigned SZ, unsigned NB_OF_RES> | |
| bool | INTERP_KERNEL.solveSystemOfEquations2 (const double *matrix, double *solutions, double eps) |
| Solve system equation in matrix form using Gaussian elimination algorithm. | |
| template<int SPACEDIM> | |
| void | INTERP_KERNEL.barycentric_coords (const double *triaCoords, const double *p, double *bc) |
| void | INTERP_KERNEL.barycentric_coords (const std::vector< const double * > &n, const double *p, double *bc) |
| double | INTERP_KERNEL.Surf_Poly (const std::vector< double > &Poly) |
| bool | INTERP_KERNEL.point_dans_triangle (const double *P_0, const double *P_1, const double *P_2, const double *P_3, double eps) |
| void | INTERP_KERNEL.verif_point_dans_vect (const double *P, std::vector< double > &V, double absolute_precision) |
| void | INTERP_KERNEL.rajou_sommet_triangl (const double *P_1, const double *P_2, const double *P_3, const double *P_4, const double *P_5, const double *P_6, std::vector< double > &V, double dim_caracteristic, double precision) |
| void | INTERP_KERNEL.inters_de_segment (const double *P_1, const double *P_2, const double *P_3, const double *P_4, std::vector< double > &Vect, double dim_caracteristic, double precision) |
| void | INTERP_KERNEL.intersec_de_triangle (const double *P_1, const double *P_2, const double *P_3, const double *P_4, const double *P_5, const double *P_6, std::vector< double > &Vect, double dim_caracteristic, double precision) |
| void | INTERP_KERNEL.verif_maill_dans_vect (int Num, std::vector< int > &V) |
| std::vector< double > | INTERP_KERNEL.reconstruct_polygon (const std::vector< double > &V) |
| template<int DIM, NumberingPolicy numPol, class MyMeshType > | |
| void | INTERP_KERNEL.getElemBB (double *bb, const double *coordsOfMesh, int iP, int nb_nodes) |
| template<int dim> | |
| double | INTERP_KERNEL.dotprod (const double *a, const double *b) |
| template<int dim> | |
| double | INTERP_KERNEL.norm (const double *v) |
| Calculates norm of a double[3] vector. | |
| template<int dim> | |
| double | INTERP_KERNEL.distance2 (const double *a, const double *b) |
| template<class T , int dim> | |
| double | INTERP_KERNEL.distance2 (T *a, int inda, T *b, int indb) |
| double | INTERP_KERNEL.determinant (double *a, double *b) |
| double | INTERP_KERNEL.determinant (double *a, double *b, double *c) |
| template<int dim> | |
| void | INTERP_KERNEL.crossprod (const double *A, const double *B, const double *C, double *V) |
| template<> | |
| void | INTERP_KERNEL.crossprod< 2 > (const double *A, const double *B, const double *C, double *V) |
| template<> | |
| void | INTERP_KERNEL.crossprod< 3 > (const double *A, const double *B, const double *C, double *V) |
| template<> | |
| void | INTERP_KERNEL.crossprod< 1 > (const double *A, const double *B, const double *C, double *V) |
| template<int dim> | |
| double | INTERP_KERNEL.check_inside (const double *A, const double *B, const double *C, const double *D, const double *E, double *ABC, double *ADE) |
| template<int dim> | |
| double | INTERP_KERNEL.angle (const double *A, const double *B, const double *C, double *n) |
| template<int dim> | |
| double | INTERP_KERNEL.direct_frame (const double *A, const double *B, const double *C, double *n) |
| template<> | |
| double | INTERP_KERNEL.direct_frame< 2 > (const double *A, const double *B, const double *C, double *n) |
| template<> | |
| double | INTERP_KERNEL.direct_frame< 3 > (const double *A, const double *B, const double *C, double *n) |
| template<int DIM> | |
| void | INTERP_KERNEL.intersec_de_polygone (const double *Coords_A, const double *Coords_B, int nb_NodesA, int nb_NodesB, std::vector< double > &inter, double dim_caracteristic, double precision) |
| template<int DIM> | |
| double | INTERP_KERNEL.polygon_area (std::vector< double > &inter) |
| template<int DIM> | |
| double | INTERP_KERNEL.polygon_area (std::deque< double > &inter) |
| double | INTERP_KERNEL.triple_product (const double *A, const double *B, const double *C, const double *X) |
| template<class T , int dim> | |
| bool | INTERP_KERNEL.checkEqualPolygonsOneDirection (T *L1, T *L2, int size1, int size2, int istart1, int istart2, double epsilon, int sign) |
| template<class T , int dim> | |
| bool | INTERP_KERNEL.checkEqualPolygons (T *L1, T *L2, double epsilon) |