NAG Library Routine Document
d06acf (dim2_gen_front)
1
Purpose
d06acf generates a triangular mesh of a closed polygonal region in ${\mathbb{R}}^{2}$, given a mesh of its boundary. It uses an Advancing Front process, based on an incremental method.
2
Specification
Fortran Interface
Subroutine d06acf ( 
nvb, nvint, nvmax, nedge, edge, nv, nelt, coor, conn, weight, itrace, rwork, lrwork, iwork, liwork, ifail) 
Integer, Intent (In)  ::  nvb, nvint, nvmax, nedge, edge(3,nedge), itrace, lrwork, liwork  Integer, Intent (Inout)  ::  ifail  Integer, Intent (Out)  ::  nv, nelt, conn(3,2*nvmax+5), iwork(liwork)  Real (Kind=nag_wp), Intent (In)  ::  weight(*)  Real (Kind=nag_wp), Intent (Inout)  ::  coor(2,nvmax)  Real (Kind=nag_wp), Intent (Out)  ::  rwork(lrwork) 

C Header Interface
#include nagmk26.h
void 
d06acf_ (const Integer *nvb, const Integer *nvint, const Integer *nvmax, const Integer *nedge, const Integer edge[], Integer *nv, Integer *nelt, double coor[], Integer conn[], const double weight[], const Integer *itrace, double rwork[], const Integer *lrwork, Integer iwork[], const Integer *liwork, Integer *ifail) 

3
Description
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).
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:
${\mathbf{nvb}}\ge 3$.
 2: $\mathbf{nvint}$ – IntegerInput

On entry: the number of fixed interior mesh vertices to which a weight will be applied.
Constraint:
${\mathbf{nvint}}\ge 0$.
 3: $\mathbf{nvmax}$ – IntegerInput

On entry: the maximum number of vertices in the mesh to be generated.
Constraint:
${\mathbf{nvmax}}\ge {\mathbf{nvb}}+{\mathbf{nvint}}$.
 4: $\mathbf{nedge}$ – IntegerInput

On entry: the number of boundary edges in the input mesh.
Constraint:
${\mathbf{nedge}}\ge 1$.
 5: $\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 d06acf.
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}}$.
 6: $\mathbf{nv}$ – IntegerOutput

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

On exit: the number of triangular elements in the mesh.
 8: $\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, for $\mathit{i}=1,2,\dots ,{\mathbf{nvb}}$.
${\mathbf{coor}}\left(1,\mathit{i}\right)$ contains the $x$ coordinate of the $\left(\mathit{i}{\mathbf{nvb}}\right)$th fixed interior vertex, for $\mathit{i}={\mathbf{nvb}}+1,\dots ,{\mathbf{nvb}}+{\mathbf{nvint}}$. For boundary and interior vertices,
${\mathbf{coor}}\left(2,\mathit{i}\right)$ contains the corresponding $y$ coordinate, for $\mathit{i}=1,2,\dots ,{\mathbf{nvb}}+{\mathbf{nvint}}$.
On exit: ${\mathbf{coor}}\left(1,\mathit{i}\right)$ will contain the $x$ coordinate of the $\left(\mathit{i}{\mathbf{nvb}}{\mathbf{nvint}}\right)$th generated interior mesh vertex, for $\mathit{i}={\mathbf{nvb}}+{\mathbf{nvint}}+1,\dots ,{\mathbf{nv}}$; while ${\mathbf{coor}}\left(2,i\right)$ will contain the corresponding $y$ coordinate. The remaining elements are unchanged.
 9: $\mathbf{conn}\left(3,2\times {\mathbf{nvmax}}+5\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}}$.
 10: $\mathbf{weight}\left(*\right)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array
weight
must be at least
$\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{nvint}}\right)$.
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 ${\mathbf{nvint}}>0$, ${\mathbf{weight}}\left(\mathit{i}\right)>0.0$, for $\mathit{i}=1,2,\dots ,{\mathbf{nvint}}$.
 11: $\mathbf{itrace}$ – IntegerInput

On entry: the level of trace information required from
d06acf.
 ${\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.
 12: $\mathbf{rwork}\left({\mathbf{lrwork}}\right)$ – Real (Kind=nag_wp) arrayWorkspace
 13: $\mathbf{lrwork}$ – IntegerInput

On entry: the dimension of the array
rwork as declared in the (sub)program from which
d06acf is called.
Constraint:
${\mathbf{lrwork}}\ge 12\times {\mathbf{nvmax}}+30015$.
 14: $\mathbf{iwork}\left({\mathbf{liwork}}\right)$ – Integer arrayWorkspace
 15: $\mathbf{liwork}$ – IntegerInput

On entry: the dimension of the array
iwork as declared in the (sub)program from which
d06acf is called.
Constraint:
${\mathbf{liwork}}\ge 8\times {\mathbf{nedge}}+53\times {\mathbf{nvmax}}+2\times {\mathbf{nvb}}+10078$.
 16: $\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{nvint}}<0$, 
or  ${\mathbf{nvb}}+{\mathbf{nvint}}>{\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  if ${\mathbf{nvint}}>0$, ${\mathbf{weight}}\left(i\right)\le 0.0$, for some $i=1,2,\dots ,{\mathbf{nvint}}$; 
or  ${\mathbf{lrwork}}<12\times {\mathbf{nvmax}}+30015$, 
or  ${\mathbf{liwork}}<8\times {\mathbf{nedge}}+53\times {\mathbf{nvmax}}+2\times {\mathbf{nvb}}+10078$. 
 ${\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
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 implementationspecific 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
${\mathcal{T}}_{i}$ to obtain the mesh
${\mathcal{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 $\left(1.5,0.0\right)$ 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 $\left(0.8,0.3\right)$. 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.
10.1
Program Text
Program Text (d06acfe.f90)
10.2
Program Data
Program Data (d06acfe.d)
10.3
Program Results
Program Results (d06acfe.r)
Figure 1: The boundary mesh (top), the interior mesh (bottom) of a
double wing inside a circle geometry