Mmg
Simplicial remeshers (mesh adaptation, isovalue discretization, lagrangian movement)
|
#include "libmmg2d_private.h"
Go to the source code of this file.
Macros | |
#define | EPST -1e-18 |
Functions | |
int | MMG2D_coorbary (MMG5_pMesh mesh, MMG5_pTria pt, double c[2], double *det, double *l1, double *l2) |
MMG5_int | MMG2D_isInTriangle (MMG5_pMesh mesh, MMG5_int k, double c[2]) |
int | MMG2D_cutEdge (MMG5_pMesh mesh, MMG5_pTria pt, MMG5_pPoint ppa, MMG5_pPoint ppb) |
int | MMG2D_cutEdgeTriangle (MMG5_pMesh mesh, MMG5_int k, MMG5_int ia, MMG5_int ib) |
MMG5_int | MMG2D_findTria (MMG5_pMesh mesh, MMG5_int ip) |
int | MMG2D_locateEdge (MMG5_pMesh mesh, MMG5_int ia, MMG5_int ib, MMG5_int *kdep, MMG5_int *list) |
#define EPST -1e-18 |
Definition at line 33 of file locate_2d.c.
int MMG2D_coorbary | ( | MMG5_pMesh | mesh, |
MMG5_pTria | pt, | ||
double | c[2], | ||
double * | det, | ||
double * | l1, | ||
double * | l2 | ||
) |
int MMG2D_cutEdge | ( | MMG5_pMesh | mesh, |
MMG5_pTria | pt, | ||
MMG5_pPoint | ppa, | ||
MMG5_pPoint | ppb | ||
) |
Definition at line 90 of file locate_2d.c.
int MMG2D_cutEdgeTriangle | ( | MMG5_pMesh | mesh, |
MMG5_int | k, | ||
MMG5_int | ia, | ||
MMG5_int | ib | ||
) |
Definition at line 129 of file locate_2d.c.
MMG5_int MMG2D_findTria | ( | MMG5_pMesh | mesh, |
MMG5_int | ip | ||
) |
mesh | pointer to mesh |
ip | point index |
Return the index of one triangle containing k.
Definition at line 221 of file locate_2d.c.
MMG5_int MMG2D_isInTriangle | ( | MMG5_pMesh | mesh, |
MMG5_int | k, | ||
double | c[2] | ||
) |
Check whether c lies in triangle k; return k if so, 0 otherwise
Definition at line 69 of file locate_2d.c.
int MMG2D_locateEdge | ( | MMG5_pMesh | mesh, |
MMG5_int | ia, | ||
MMG5_int | ib, | ||
MMG5_int * | kdep, | ||
MMG5_int * | list | ||
) |
mesh | pointer to the mesh |
ia | index of first extremity of the edge |
ib | index of second extremity of the edge |
kdep | pointer to the index of the first element intersecting the edge |
list | pointer to 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 starts at index 0 (and ends at index lon-1). It stores 3*k + iare, where k is an intersected tria and iare is an intersected edge.
prod1, prod2 and prod3 allow to localize the edge regarding the tria:
ia-ib intersect 2 triangle edges => 2 products are <0, 1 is >0
Definition at line 329 of file locate_2d.c.