mmg2d
|
#include "mmg2d.h"
Macros | |
#define | EPST -1e-18 |
#define | EPSR 1e+18 |
#define | EPSNULL 1e-12 |
#define | EPSNULL2 5e-13 |
Functions | |
int | MMG2_coorbary (MMG5_pMesh mesh, MMG5_pTria pt, double c[2], double *det, double *l1, double *l2) |
int | MMG2_isInTriangle (MMG5_pMesh mesh, int k, double c[2]) |
int | MMG2_cutEdge (MMG5_pMesh mesh, MMG5_pTria pt, MMG5_pPoint ppa, MMG5_pPoint ppb) |
int | MMG2_cutEdgeTriangle (MMG5_pMesh mesh, int k, int ia, int ib) |
int | MMG2_findTria (MMG5_pMesh mesh, int ip) |
int | MMG2_locateEdge (MMG5_pMesh mesh, int ia, int ib, int *kdep, int *list) |
#define EPSNULL 1e-12 |
#define EPSNULL2 5e-13 |
#define EPSR 1e+18 |
#define EPST -1e-18 |
int MMG2_coorbary | ( | MMG5_pMesh | mesh, |
MMG5_pTria | pt, | ||
double | c[2], | ||
double * | det, | ||
double * | l1, | ||
double * | l2 | ||
) |
int MMG2_cutEdge | ( | MMG5_pMesh | mesh, |
MMG5_pTria | pt, | ||
MMG5_pPoint | ppa, | ||
MMG5_pPoint | ppb | ||
) |
int MMG2_cutEdgeTriangle | ( | MMG5_pMesh | mesh, |
int | k, | ||
int | ia, | ||
int | ib | ||
) |
int MMG2_findTria | ( | MMG5_pMesh | mesh, |
int | ip | ||
) |
Return the index of one triangle containing ip
int MMG2_isInTriangle | ( | MMG5_pMesh | mesh, |
int | k, | ||
double | c[2] | ||
) |
Check whether c lies in triangle k; return k if so, 0 otherwise
int MMG2_locateEdge | ( | MMG5_pMesh | mesh, |
int | ia, | ||
int | ib, | ||
int * | kdep, | ||
int * | list | ||
) |
mesh | pointer toward the mesh |
ia | index of first extremity of the edge |
ib | index of second extremity of the edge |
kdep | pointer toward the index of the first element intersecting the edge |
list | pointer toward the list of elts intersected by the edge |
Calculate the list of all the triangles intersected by edge (ia,ib), starting from kdep = one triangle in the ball of ia; List lon starts at index 0 and goes to lon-1 and stores 3*k + iare, where iare is one intersected edge; return 4 if edge exists in the mesh