delone_2d.c File Reference

#include "mmg2d.h"

Include dependency graph for delone_2d.c:

Macros
#define	MMG2D_AREAMIN   1e-15
#define	KTA   7
#define	KTB   11

Functions
static int	MMG2D_correction_iso (MMG5_pMesh mesh, int ip, int *list, int ilist, int nedep)
static int	MMG2D_hashEdgeDelone (MMG5_pMesh mesh, MMG5_Hash *hash, int iel, int i)
int	MMG2D_cavity (MMG5_pMesh mesh, MMG5_pSol sol, int ip, int *list)
int	MMG2D_delone (MMG5_pMesh mesh, MMG5_pSol sol, int ip, int *list, int ilist)

Macro Definition Documentation

KTA

#define KTA   7

KTB

#define KTB   11

MMG2D_AREAMIN

#define MMG2D_AREAMIN   1e-15

Function Documentation

MMG2D_cavity()

int MMG2D_cavity	(	MMG5_pMesh	mesh,
		MMG5_pSol	sol,
		int	ip,
		int *	list
	)

Create the cavity point ip, starting from triangle list[0]; Return a negative value for ilist if one of the triangles of the cavity is required

Here is the call graph for this function:

Here is the caller graph for this function:

MMG2D_correction_iso()

static int MMG2D_correction_iso ( MMG5_pMesh  mesh, int  ip, int *  list, int  ilist, int  nedep  )

static

Here is the caller graph for this function:

MMG2D_delone()

int MMG2D_delone	(	MMG5_pMesh	mesh,
		MMG5_pSol	sol,
		int	ip,
		int *	list,
		int	ilist
	)

Parameters

mesh	pointer toward the mesh
sol	pointer toward the solution (metric) structure
ip	index of point to insert
list	Cavity of the point ip.
ilist	number of trias in the cavity of ip.

Returns

0 if the point can't be inserted, -1 if lack of memory, 1 if success.

Insertion in point ip in the cavity described by list.

Here is the call graph for this function:

Here is the caller graph for this function:

MMG2D_hashEdgeDelone()

static int MMG2D_hashEdgeDelone ( MMG5_pMesh  mesh, MMG5_Hash *  hash, int  iel, int  i  )

static

Parameters

mesh	pointer toward the mesh structure
hash	pointer toward the hash table structure
iel	index of triangle
i	index of the face of the element

Returns

0 if fail, 1 if success

Update of the adjacency relationships adjacencies: hash mesh edge (face i of iel) and fill the adjacency arrays if the face has already been seen.

Here is the call graph for this function:

Here is the caller graph for this function: