NAG Library Routine Document
d06aaf (dim2_gen_inc)
1
Purpose
d06aaf generates a triangular mesh of a closed polygonal region in ${\mathbb{R}}^{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*(nvmax1)), 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 nagmk26.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) 

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: $\mathbf{nvb}$ – IntegerInput

On entry: the number of vertices in the input boundary mesh.
Constraint:
$3\le {\mathbf{nvb}}\le {\mathbf{nvmax}}$.
 2: $\mathbf{nvmax}$ – IntegerInput

On entry: the maximum number of vertices in the mesh to be generated.
 3: $\mathbf{nedge}$ – IntegerInput

On entry: the number of boundary edges in the input mesh.
Constraint:
${\mathbf{nedge}}\ge 1$.
 4: $\mathbf{edge}\left(3,{\mathbf{nedge}}\right)$ – Integer arrayInput

On entry: the specification of the boundary edges. ${\mathbf{edge}}\left(1,j\right)$ and ${\mathbf{edge}}\left(2,j\right)$ contain the vertex numbers of the two end points of the $j$th boundary edge. ${\mathbf{edge}}\left(3,j\right)$ is a usersupplied tag for the $j$th boundary edge and is not used by d06aaf.
Constraint:
$1\le {\mathbf{edge}}\left(\mathit{i},\mathit{j}\right)\le {\mathbf{nvb}}$ and ${\mathbf{edge}}\left(1,\mathit{j}\right)\ne {\mathbf{edge}}\left(2,\mathit{j}\right)$, for $\mathit{i}=1,2$ and $\mathit{j}=1,2,\dots ,{\mathbf{nedge}}$.
 5: $\mathbf{nv}$ – IntegerOutput

On exit: the total number of vertices in the output mesh (including both boundary and interior vertices). If ${\mathbf{nvb}}={\mathbf{nvmax}}$, no interior vertices will be generated and ${\mathbf{nv}}={\mathbf{nvb}}$.
 6: $\mathbf{nelt}$ – IntegerOutput

On exit: the number of triangular elements in the mesh.
 7: $\mathbf{coor}\left(2,{\mathbf{nvmax}}\right)$ – Real (Kind=nag_wp) arrayInput/Output

On entry: ${\mathbf{coor}}\left(1,\mathit{i}\right)$ contains the $x$ coordinate of the $\mathit{i}$th input boundary mesh vertex; while ${\mathbf{coor}}\left(2,\mathit{i}\right)$ contains the corresponding $y$ coordinate, for $\mathit{i}=1,2,\dots ,{\mathbf{nvb}}$.
On exit: ${\mathbf{coor}}\left(1,\mathit{i}\right)$ will contain the $x$ coordinate of the $\left(\mathit{i}{\mathbf{nvb}}\right)$th generated interior mesh vertex; while ${\mathbf{coor}}\left(2,\mathit{i}\right)$ will contain the corresponding $y$ coordinate, for $\mathit{i}={\mathbf{nvb}}+1,\dots ,{\mathbf{nv}}$. The remaining elements are unchanged.
 8: $\mathbf{conn}\left(3,2\times \left({\mathbf{nvmax}}1\right)\right)$ – Integer arrayOutput

On exit: the connectivity of the mesh between triangles and vertices. For each triangle
$\mathit{j}$, ${\mathbf{conn}}\left(\mathit{i},\mathit{j}\right)$ gives the indices of its three vertices (in anticlockwise order), for $\mathit{i}=1,2,3$ and $\mathit{j}=1,2,\dots ,{\mathbf{nelt}}$.
 9: $\mathbf{bspace}\left({\mathbf{nvb}}\right)$ – Real (Kind=nag_wp) arrayInput

On entry: the desired mesh spacing (triangle diameter, which is the length of the longer edge of the triangle) near the boundary vertices.
Constraint:
${\mathbf{bspace}}\left(\mathit{i}\right)>0.0$, for $\mathit{i}=1,2,\dots ,{\mathbf{nvb}}$.
 10: $\mathbf{smooth}$ – LogicalInput

On entry: indicates whether or not mesh smoothing should be performed.
If ${\mathbf{smooth}}=\mathrm{.TRUE.}$, the smoothing is performed; otherwise no smoothing is performed.
 11: $\mathbf{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
$\mathit{O}\left({{\mathbf{coef}}}^{2}\right)$. The mesh will be finer if
coef is greater than
$0.7165$ and
$0.75$ is a good value.
Suggested value:
$0.75$.
 12: $\mathbf{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.1\le {\mathbf{power}}\le 10.0$.
 13: $\mathbf{itrace}$ – IntegerInput

On entry: the level of trace information required from
d06aaf.
 ${\mathbf{itrace}}\le 0$
 No output is generated.
 ${\mathbf{itrace}}\ge 1$
 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 ${\mathbf{itrace}}=0$, unless you are experienced with finite element mesh generation.
 14: $\mathbf{rwork}\left({\mathbf{lrwork}}\right)$ – Real (Kind=nag_wp) arrayWorkspace
 15: $\mathbf{lrwork}$ – IntegerInput

On entry: the dimension of the array
rwork as declared in the (sub)program from which
d06aaf is called.
Constraint:
${\mathbf{lrwork}}\ge {\mathbf{nvmax}}$.
 16: $\mathbf{iwork}\left({\mathbf{liwork}}\right)$ – Integer arrayWorkspace
 17: $\mathbf{liwork}$ – IntegerInput

On entry: the dimension of the array
iwork as declared in the (sub)program from which
d06aaf is called.
Constraint:
${\mathbf{liwork}}\ge 16\times {\mathbf{nvmax}}+2\times {\mathbf{nedge}}+\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(4\times {\mathbf{nvmax}}+2,{\mathbf{nedge}}\right)14$.
 18: $\mathbf{ifail}$ – IntegerInput/Output

On entry:
ifail must be set to
$0$,
$1\text{ or}1$. If you are unfamiliar with this argument you should refer to
Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{ 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 $\mathbf{1}\text{ or}\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit:
${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
${\mathbf{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:
 ${\mathbf{ifail}}=1$

On entry,  ${\mathbf{nvb}}<3$ or ${\mathbf{nvb}}>{\mathbf{nvmax}}$, 
or  ${\mathbf{nedge}}<1$, 
or  ${\mathbf{edge}}\left(i,j\right)<1$ or ${\mathbf{edge}}\left(i,j\right)>{\mathbf{nvb}}$, for some $i=1,2$ and $j=1,2,\dots ,{\mathbf{nedge}}$, 
or  ${\mathbf{edge}}\left(1,j\right)={\mathbf{edge}}\left(2,j\right)$, for some $j=1,2,\dots ,{\mathbf{nedge}}$, 
or  ${\mathbf{bspace}}\left(i\right)\le 0.0$, for some $i=1,2,\dots ,{\mathbf{nvb}}$, 
or  ${\mathbf{power}}<0.1$ or ${\mathbf{power}}>10.0$, 
or  ${\mathbf{liwork}}<16\times {\mathbf{nvmax}}+2\times {\mathbf{nedge}}+\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(4\times {\mathbf{nvmax}}+2,{\mathbf{nedge}}\right)14$, 
or  ${\mathbf{lrwork}}<{\mathbf{nvmax}}$. 
 ${\mathbf{ifail}}=2$

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
${\mathbf{itrace}}>0$ may provide more details.
 ${\mathbf{ifail}}=99$
An unexpected error has been triggered by this routine. Please
contact
NAG.
See
Section 3.9 in How to Use the NAG Library and its Documentation for further information.
 ${\mathbf{ifail}}=399$
Your licence key may have expired or may not have been installed correctly.
See
Section 3.8 in How to Use the NAG Library and its Documentation for further information.
 ${\mathbf{ifail}}=999$
Dynamic memory allocation failed.
See
Section 3.7 in How to Use the NAG Library and its Documentation for further information.
7
Accuracy
Not applicable.
8
Parallelism and Performance
d06aaf is not threaded in any implementation.
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
$\left(0.5,0.0\right)$ with a radius
$0.49$, and the second one is centred at the point
$\left(0.5,0.65\right)$ with a radius
$0.15$. Note that the points
$\left(1.0,0.0\right)$ and
$\left(0.5,0.5\right)$) 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)