void	d06acc (Integer nvb, Integer nvint, Integer nvmax, Integer nedge, const Integer edge[], Integer nv, Integer nelt, double coor[], Integer conn[], const double weight[], Integer itrace, const char outfile, NagError fail)

The function may be called by the names: d06acc, nag_mesh_dim2_gen_front or nag_mesh2d_front.

3 Description

d06acc generates the set of interior vertices using an Advancing Front process, based on an incremental method. It allows you to specify a number of fixed interior mesh vertices together with weights which allow concentration of the mesh in their neighbourhood. For more details about the triangulation method, consult the D06 Chapter Introduction as well as George and Borouchaki (1998).

This function is derived from material in the MODULEF package from INRIA (Institut National de Recherche en Informatique et Automatique).

4 References

George P L and Borouchaki H (1998) Delaunay Triangulation and Meshing: Application to Finite Elements Editions HERMES, Paris

5 Arguments

1: $nvb$ – Integer Input

On entry: the number of vertices in the input boundary mesh.

Constraint:

nvb \geq 3

2: $nvint$ – Integer Input

On entry: the number of fixed interior mesh vertices to which a weight will be applied.

Constraint:

nvint \geq 0

3: $nvmax$ – Integer Input

On entry: the maximum number of vertices in the mesh to be generated.

Constraint:

nvmax \geq nvb + nvint

4: $nedge$ – Integer Input

On entry: the number of boundary edges in the input mesh.

Constraint:

nedge \geq 1

5: $edge [3 \times nedge]$ – const Integer Input

Note: the

(i, j)

th element of the matrix is stored in

edge [(j - 1) \times 3 + i - 1]

On entry: the specification of the boundary edges.

edge [(j - 1) \times 3]

and

edge [(j - 1) \times 3 + 1]

contain the vertex numbers of the two end points of the

j

th boundary edge.

edge [(j - 1) \times 3 + 2]

is a user-supplied tag for the

j

th boundary edge and is not used by d06acc. Note that the edge vertices are numbered from

1

to nvb.

Constraint:

1 \leq edge [(j - 1) \times 3 + i - 1] \leq nvb

and

edge [(j - 1) \times 3] \neq edge [(j - 1) \times 3 + 1]

, for

i = 1, 2

and

j = 1, 2, \dots, nedge

6: $nv$ – Integer * Output

On exit: the total number of vertices in the output mesh (including both boundary and interior vertices). If

nvb + nvint = nvmax

, no interior vertices will be generated and

nv = nvmax

7: $nelt$ – Integer * Output

On exit: the number of triangular elements in the mesh.

8: $coor [2 \times nvmax]$ – double Input/Output

Note: the

(i, j)

th element of the matrix is stored in

coor [(j - 1) \times 2 + i - 1]

On entry:

coor [(i - 1) \times 2]

contains the

x

coordinate of the

i

th input boundary mesh vertex, for

i = 1, 2, \dots, nvb

coor [(i - 1) \times 2]

contains the

x

coordinate of the

(i - nvb)

th fixed interior vertex, for

i = nvb + 1, \dots, nvb + nvint

. For boundary and interior vertices,

coor [(i - 1) \times 2 + 1]

contains the corresponding

y

coordinate, for

i = 1, 2, \dots, nvb + nvint

On exit:

coor [(i - 1) \times 2]

will contain the

x

coordinate of the

(i - nvb - nvint)

th generated interior mesh vertex, for

i = nvb + nvint + 1, \dots, nv

; while

coor [(i - 1) \times 2 + 1]

will contain the corresponding

y

coordinate. The remaining elements are unchanged.

9: $conn [3 \times (2 \times nvmax + 5)]$ – Integer Output

Note: the

(i, j)

th element of the matrix is stored in

conn [(j - 1) \times 3 + i - 1]

On exit: the connectivity of the mesh between triangles and vertices. For each triangle

j

conn [(j - 1) \times 3 + i - 1]

gives the indices of its three vertices (in anticlockwise order), for

i = 1, 2, 3

and

j = 1, 2, \dots, nelt

. Note that the mesh vertices are numbered from

1

to nv.

10: $weight [\dim]$ – const double Input

Note: the dimension, dim, of the array weight must be at least

\max (1, nvint)

On entry: the weight of fixed interior vertices. It is the diameter of triangles (length of the longer edge) created around each of the given interior vertices.

Constraint: if

nvint > 0

weight [i - 1] > 0.0

, for

i = 1, 2, \dots, nvint

11: $itrace$ – Integer Input

On entry: the level of trace information required from d06acc.

$itrace \leq 0$: No output is generated.
$itrace \geq 1$: Output from the meshing solver is printed. This output contains details of the vertices and triangles generated by the process.

You are advised to set

itrace = 0

, unless you are experienced with finite element mesh generation.

12: $outfile$ – const char * Input

On entry: the name of a file to which diagnostic output will be directed. If outfile is NULL the diagnostic output will be directed to standard output.

13: $fail$ – NagError * Input/Output

The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM: On entry, argument $⟨ value ⟩$ had an illegal value.
NE_INT: On entry, $nedge = ⟨ value ⟩$ .
Constraint: $nedge \geq 1$ .

On entry, $nvb = ⟨ value ⟩$ .
Constraint: $nvb \geq 3$ .

On entry, $nvint = ⟨ value ⟩$ .
Constraint: $nvint \geq 0$ .
NE_INT_2: On entry, the end points of the edge $J$ have the same index $I$ : $J = ⟨ value ⟩$ and $I = ⟨ value ⟩$ .
NE_INT_3: On entry, $nv = ⟨ value ⟩$ , $nvint = ⟨ value ⟩$ and $nvmax = ⟨ value ⟩$ .
Constraint: $nvb + nvint \leq nvmax$ .

On entry, $nvb = ⟨ value ⟩$ , $nvint = ⟨ value ⟩$ and $nvmax = ⟨ value ⟩$ .
Constraint: $nvmax \geq nvb + nvint$ .
NE_INT_4: On entry, $edge (I, J) = ⟨ value ⟩$ , $I = ⟨ value ⟩$ , $J = ⟨ value ⟩$ and $nvb = ⟨ value ⟩$ .
Constraint: $edge (I, J) \geq 1$ and $edge (I, J) \leq nvb$ , where $edge (I, J)$ denotes $edge [(J - 1) \times 3 + I - 1]$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_MESH_ERROR: An error has occurred during the generation of the boundary mesh. Check the definition of the boundary (arguments coor and edge) as well as the orientation of the boundary (especially in the case of a multiple connected component boundary). Setting $itrace > 0$ may provide more details.

An error has occurred during the generation of the interior mesh. Check the definition of the boundary (arguments coor and edge) as well as the orientation of the boundary (especially in the case of a multiple connected component boundary). Setting $itrace > 0$ may provide more details.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_NOT_CLOSE_FILE: Cannot close file $⟨ value ⟩$ .
NE_NOT_WRITE_FILE: Cannot open file $⟨ value ⟩$ for writing.
NE_REAL_ARRAY_INPUT: On entry, $weight [I - 1] = ⟨ value ⟩$ and $I = ⟨ value ⟩$ .
Constraint: $weight [I - 1] > 0.0$ .

7 Accuracy

Not applicable.

8 Parallelism and Performance

d06acc makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The position of the internal vertices is a function position of the vertices on the given boundary. A fine mesh on the boundary results in a fine mesh in the interior. During the process vertices are generated on edges of the mesh

T_{i}

to obtain the mesh

T_{i + 1}

in the general incremental method (consult the D06 Chapter Introduction or George and Borouchaki (1998)).

You are advised to take care to set the boundary inputs properly, especially for a boundary with multiply connected components. The orientation of the interior boundaries should be in clockwise order and opposite to that of the exterior boundary. If the boundary has only one connected component, its orientation should be anticlockwise.

10 Example

In this example, a geometry with two holes (two wings inside an exterior circle) is meshed using a Delaunay–Voronoi method. The exterior circle is centred at the point

(1.5, 0.0)

with a radius

4.5

, the first wing begins at the origin and it is normalized, finally the last wing is also normalized and begins at the point

(0.8, - 0.3)

. To be able to carry out some realistic computation on that geometry, some interior points have been introduced to have a finer mesh in the wake of those airfoils.

The boundary mesh has

120

vertices and

120

edges (see Figure 1 top). Note that the particular mesh generated could be sensitive to the machine precision and, therefore, may differ from one implementation to another.