NAG FL Interface
d06aaf (dim2_​gen_​inc)

1 Purpose

d06aaf generates a triangular mesh of a closed polygonal region in 2, given a mesh of its boundary. It uses a simple incremental method.

2 Specification

Fortran Interface
Subroutine d06aaf ( nvb, nvmax, nedge, edge, nv, nelt, coor, conn, bspace, smooth, coef, power, itrace, rwork, lrwork, iwork, liwork, ifail)
Integer, Intent (In) :: nvb, nvmax, nedge, edge(3,nedge), itrace, lrwork, liwork
Integer, Intent (Inout) :: ifail
Integer, Intent (Out) :: nv, nelt, conn(3,2*(nvmax-1)), iwork(liwork)
Real (Kind=nag_wp), Intent (In) :: bspace(nvb), coef, power
Real (Kind=nag_wp), Intent (Inout) :: coor(2,nvmax)
Real (Kind=nag_wp), Intent (Out) :: rwork(lrwork)
Logical, Intent (In) :: smooth
C Header Interface
#include <nag.h>
void  d06aaf_ (const Integer *nvb, const Integer *nvmax, const Integer *nedge, const Integer edge[], Integer *nv, Integer *nelt, double coor[], Integer conn[], const double bspace[], const logical *smooth, const double *coef, const double *power, const Integer *itrace, double rwork[], const Integer *lrwork, Integer iwork[], const Integer *liwork, Integer *ifail)
The routine may be called by the names d06aaf or nagf_mesh_dim2_gen_inc.

3 Description

d06aaf generates the set of interior vertices using a process based on a simple incremental method. A smoothing of the mesh is optionally available. 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).

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: 3nvbnvmax.
2: nvmax Integer Input
On entry: the maximum number of vertices in the mesh to be generated.
3: nedge Integer Input
On entry: the number of boundary edges in the input mesh.
Constraint: nedge1.
4: edge3nedge Integer array Input
On entry: the specification of the boundary edges. edge1j and edge2j contain the vertex numbers of the two end points of the jth boundary edge. edge3j is a user-supplied tag for the jth boundary edge and is not used by d06aaf.
Constraint: 1edgeijnvb and edge1jedge2j, for i=1,2 and j=1,2,,nedge.
5: nv Integer Output
On exit: the total number of vertices in the output mesh (including both boundary and interior vertices). If nvb=nvmax, no interior vertices will be generated and nv=nvb.
6: nelt Integer Output
On exit: the number of triangular elements in the mesh.
7: coor2nvmax Real (Kind=nag_wp) array Input/Output
On entry: coor1i contains the x coordinate of the ith input boundary mesh vertex; while coor2i contains the corresponding y coordinate, for i=1,2,,nvb.
On exit: coor1i will contain the x coordinate of the i-nvbth generated interior mesh vertex; while coor2i will contain the corresponding y coordinate, for i=nvb+1,,nv. The remaining elements are unchanged.
8: conn32×nvmax-1 Integer array Output
On exit: the connectivity of the mesh between triangles and vertices. For each triangle j, connij gives the indices of its three vertices (in anticlockwise order), for i=1,2,3 and j=1,2,,nelt.
9: bspacenvb Real (Kind=nag_wp) array Input
On entry: the desired mesh spacing (triangle diameter, which is the length of the longer edge of the triangle) near the boundary vertices.
Constraint: bspacei>0.0, for i=1,2,,nvb.
10: smooth Logical Input
On entry: indicates whether or not mesh smoothing should be performed.
If smooth=.TRUE., the smoothing is performed; otherwise no smoothing is performed.
11: coef Real (Kind=nag_wp) Input
On entry: the coefficient in the stopping criteria for the generation of interior vertices. This argument controls the triangle density and the number of triangles generated is in Ocoef2. The mesh will be finer if coef is greater than 0.7165 and 0.75 is a good value.
Suggested value: 0.75.
12: power Real (Kind=nag_wp) Input
On entry: controls the rate of change of the mesh size during the generation of interior vertices. The smaller the value of power, the faster the decrease in element size away from the boundary.
Suggested value: 0.25.
Constraint: 0.1power10.0.
13: itrace Integer Input
On entry: the level of trace information required from d06aaf.
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 itrace=0, unless you are experienced with finite element mesh generation.
14: rworklrwork Real (Kind=nag_wp) array Workspace
15: lrwork Integer Input
On entry: the dimension of the array rwork as declared in the (sub)program from which d06aaf is called.
Constraint: lrworknvmax.
16: iworkliwork Integer array Workspace
17: liwork Integer Input
On entry: the dimension of the array iwork as declared in the (sub)program from which d06aaf is called.
Constraint: liwork16×nvmax+2×nedge+max4×nvmax+2,nedge-14.
18: ifail Integer Input/Output
On entry: ifail must be set to 0, -1 or 1. If you are unfamiliar with this argument you should refer to Section 4 in the Introduction to the NAG Library FL Interface for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1 or 1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this argument, the recommended value is 0. When the value -1 or 1 is used it is essential to test the value of ifail on exit.
On exit: ifail=0 unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry ifail=0 or -1, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
On entry, bspaceI=value and I=value.
Constraint: bspaceI>0.0.
On entry, edgeI,J=value, I=value, J=value and nvb=value.
Constraint: edgeI,J1 and edgeI,Jnvb.
On entry, liwork=value and LIWKMN=value.
Constraint: liworkLIWKMN.
On entry, lrwork=value and LRWKMN=value.
Constraint: lrworkLRWKMN.
On entry, nedge=value.
Constraint: nedge1.
On entry, nvb=value and nvmax=value.
Constraint: 3nvbnvmax.
On entry, power=value.
Constraint: power10.0.
On entry, power=value.
Constraint: power0.1.
On entry, the end points of the edge J have the same index I: J=value and I=value.
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.
An unexpected error has been triggered by this routine. Please contact NAG.
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.

7 Accuracy

Not applicable.

8 Parallelism and Performance

d06aaf is not threaded in any implementation.

9 Further Comments

The position of the internal vertices is a function of the positions of the vertices on the given boundary. A fine mesh on the boundary results in a fine mesh in the interior. The algorithm allows you to obtain a denser interior mesh by varying nvmax, bspace, coef and power. But you are advised to manipulate the last two arguments with care.
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 interior circles inside an exterior one) is meshed using the simple incremental method (see the D06 Chapter Introduction). The exterior circle is centred at the origin with a radius 1.0, the first interior circle is centred at the point -0.5,0.0 with a radius 0.49, and the second one is centred at the point -0.5,0.65 with a radius 0.15. Note that the points -1.0,0.0 and -0.5,0.5) are points of ‘near tangency’ between the exterior circle and the first and second circles.
The boundary mesh has 100 vertices and 100 edges (see Figure 1 in Section 10.3). Note that the particular mesh generated could be sensitive to the machine precision and therefore may differ from one implementation to another. Figure 2 in Section 10.3 contains the output mesh.

10.1 Program Text

Program Text (d06aafe.f90)

10.2 Program Data

Program Data (d06aafe.d)

10.3 Program Results

Program Results (d06aafe.r)
GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Example Program Figure 1: The Geometry of Circular Region With Two Holes gnuplot_plot_1
GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Figure 2: Mesh Generated on the Geometry With Two Holes gnuplot_plot_1