The routine may be called by the names d06acf or nagf_mesh_dim2_gen_front.
d06acf 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 routine is derived from material in the MODULEF package from INRIA (Institut National de Recherche en Informatique et Automatique).
George P L and Borouchaki H (1998) Delaunay Triangulation and Meshing: Application to Finite Elements Editions HERMES, Paris
1: – IntegerInput
On entry: the number of vertices in the input boundary mesh.
2: – IntegerInput
On entry: the number of fixed interior mesh vertices to which a weight will be applied.
3: – IntegerInput
On entry: the maximum number of vertices in the mesh to be generated.
4: – IntegerInput
On entry: the number of boundary edges in the input mesh.
5: – Integer arrayInput
On entry: the specification of the boundary edges. and contain the vertex numbers of the two end points of the th boundary edge. is a user-supplied tag for the th boundary edge and is not used by d06acf.
and , for and .
6: – IntegerOutput
On exit: the total number of vertices in the output mesh (including both boundary and interior vertices). If , no interior vertices will be generated and .
7: – IntegerOutput
On exit: the number of triangular elements in the mesh.
8: – Real (Kind=nag_wp) arrayInput/Output
On entry: contains the coordinate of the th input boundary mesh vertex, for .
contains the coordinate of the th fixed interior vertex, for . For boundary and interior vertices,
contains the corresponding coordinate, for .
On exit: will contain the coordinate of the th generated interior mesh vertex, for ; while will contain the corresponding coordinate. The remaining elements are unchanged.
9: – Integer arrayOutput
On exit: the connectivity of the mesh between triangles and vertices. For each triangle
, gives the indices of its three vertices (in anticlockwise order), for and .
10: – Real (Kind=nag_wp) arrayInput
Note: the dimension of the array weight
must be at least
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.
if , , for .
11: – IntegerInput
On entry: the level of trace information required from d06acf.
No output is generated.
Output from the meshing solver is printed on the current advisory message unit (see x04abf). This output contains details of the vertices and triangles generated by the process.
You are advised to set , unless you are experienced with finite element mesh generation.
12: – Real (Kind=nag_wp) arrayWorkspace
13: – IntegerInput
On entry: the dimension of the array rwork as declared in the (sub)program from which d06acf is called.
14: – Integer arrayWorkspace
15: – IntegerInput
On entry: the dimension of the array iwork as declared in the (sub)program from which d06acf is called.
16: – IntegerInput/Output
On entry: ifail must be set to , or to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value or is recommended. If message printing is undesirable, then the value is recommended. Otherwise, the value is recommended. When the value or is used it is essential to test the value of ifail on exit.
On exit: unless the routine detects an error or a warning has been flagged (see Section 6).
6Error Indicators and Warnings
If on entry or , explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
On entry, , , and .
Constraint: and .
On entry, and .
On entry, and .
On entry, .
On entry, , and .
On entry, .
On entry, .
On entry, the end points of the edge have the same index : and .
On entry, and .
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 may provide more details.
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 may provide more details.
An unexpected error has been triggered by this routine. Please
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.
8Parallelism and Performance
d06acf 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 routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.
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 to obtain the mesh 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.
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 with a radius , the first wing begins at the origin and it is normalized, finally the last wing is also normalized and begins at the point . 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 vertices and 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.