D06ABF (PDF version)
D06 Chapter Contents
D06 Chapter Introduction
NAG Library Manual

NAG Library Routine Document

D06ABF

Note:  before using this routine, please read the Users' Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent details.

 Contents

    1  Purpose
    7  Accuracy

1  Purpose

D06ABF generates a triangular mesh of a closed polygonal region in 2, given a mesh of its boundary. It uses a Delaunay–Voronoi process, based on an incremental method.

2  Specification

SUBROUTINE D06ABF ( NVB, NVINT, NVMAX, NEDGE, EDGE, NV, NELT, COOR, CONN, WEIGHT, NPROPA, ITRACE, RWORK, LRWORK, IWORK, LIWORK, IFAIL)
INTEGER  NVB, NVINT, NVMAX, NEDGE, EDGE(3,NEDGE), NV, NELT, CONN(3,2*NVMAX+5), NPROPA, ITRACE, LRWORK, IWORK(LIWORK), LIWORK, IFAIL
REAL (KIND=nag_wp)  COOR(2,NVMAX), WEIGHT(*), RWORK(LRWORK)

3  Description

D06ABF generates the set of interior vertices using a Delaunay–Voronoi 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  Parameters

1:     NVB – INTEGERInput
On entry: the number of vertices in the input boundary mesh.
Constraint: NVB3.
2:     NVINT – INTEGERInput
On entry: the number of fixed interior mesh vertices to which a weight will be applied.
Constraint: NVINT0.
3:     NVMAX – INTEGERInput
On entry: the maximum number of vertices in the mesh to be generated.
Constraint: NVMAXNVB+NVINT.
4:     NEDGE – INTEGERInput
On entry: the number of boundary edges in the input mesh.
Constraint: NEDGE1.
5:     EDGE3NEDGE – INTEGER arrayInput
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 D06ABF.
Constraint: 1EDGEijNVB and EDGE1jEDGE2j, for i=1,2 and j=1,2,,NEDGE.
6:     NV – INTEGEROutput
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 – INTEGEROutput
On exit: the number of triangular elements in the mesh.
8:     COOR2NVMAX – REAL (KIND=nag_wp) arrayInput/Output
On entry: COOR1i contains the x coordinate of the ith input boundary mesh vertex, for i=1,2,,NVB. COOR1i contains the x coordinate of the i-NVBth fixed interior vertex, for i=NVB+1,,NVB+NVINT. For boundary and interior vertices, COOR2i contains the corresponding y coordinate, for i=1,2,,NVB+NVINT.
On exit: COOR1i will contain the x coordinate of the i-NVB-NVINTth generated interior mesh vertex, for i=NVB+NVINT+1,,NV; while COOR2i will contain the corresponding y coordinate. The remaining elements are unchanged.
9:     CONN32×NVMAX+5 – INTEGER arrayOutput
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.
10:   WEIGHT* – REAL (KIND=nag_wp) arrayInput
Note: the dimension of the array WEIGHT must be at least max1,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, WEIGHTi>0.0, for i=1,2,,NVINT.
11:   NPROPA – INTEGERInput
On entry: the propagation type and coefficient, the parameter NPROPA is used when the internal points are created. They are distributed in a geometric manner if NPROPA is positive and in an arithmetic manner if it is negative. For more details see Section 9.
Constraint: NPROPA0.
12:   ITRACE – INTEGERInput
On entry: the level of trace information required from D06ABF.
ITRACE0
No output is generated.
ITRACE1
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.
13:   RWORKLRWORK – REAL (KIND=nag_wp) arrayWorkspace
14:   LRWORK – INTEGERInput
On entry: the dimension of the array RWORK as declared in the (sub)program from which D06ABF is called.
Constraint: LRWORK12×NVMAX+15.
15:   IWORKLIWORK – INTEGER arrayWorkspace
16:   LIWORK – INTEGERInput
On entry: the dimension of the array IWORK as declared in the (sub)program from which D06ABF is called.
Constraint: LIWORK6×NEDGE+32×NVMAX+2×NVB+78.
17:   IFAIL – INTEGERInput/Output
On entry: IFAIL must be set to 0, -1​ or ​1. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction 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 parameter, 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:
IFAIL=1
On entry,NVB<3,
orNVINT<0,
orNVB+NVINT>NVMAX,
orNEDGE<1,
orEDGEij<1 or EDGEij>NVB, for some i=1,2 and j=1,2,,NEDGE,
orEDGE1j=EDGE2j, for some j=1,2,,NEDGE,
orNPROPA=0;
orif NVINT>0, WEIGHTi0.0, for some i=1,2,,NVINT;
orLRWORK<12×NVMAX+15,
orLIWORK<6×NEDGE+32×NVMAX+2×NVB+78.
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 ITRACE>0 may provide more details.
IFAIL=3
An error has occurred during the generation of the boundary mesh. It appears that NVMAX is not large enough.
IFAIL=-99
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.8 in the Essential Introduction for further information.
IFAIL=-399
Your licence key may have expired or may not have been installed correctly.
See Section 3.7 in the Essential Introduction for further information.
IFAIL=-999
Dynamic memory allocation failed.
See Section 3.6 in the Essential Introduction for further information.

7  Accuracy

Not applicable.

8  Parallelism and Performance

D06ABF is not threaded by NAG in any implementation.
D06ABF 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.

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. To dilute the influence of the data on the interior of the domain, the value of NPROPA can be changed. The propagation coefficient is calculated as: ω=1+ a-1.020.0 , where a is the absolute value of NPROPA. During the process vertices are generated on edges of the mesh Ti to obtain the mesh Ti+1 in the general incremental method (consult the D06 Chapter Introduction or George and Borouchaki (1998)). This generation uses the coefficient ω, and it is geometric if NPROPA>0, and arithmetic otherwise. But increasing the value of a may lead to failure of the process, due to precision, especially in geometries with holes. So you are advised to manipulate the parameter NPROPA 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 wings inside an exterior circle) is meshed using a Delaunay–Voronoi method. The exterior circle is centred at the point 1.0,0.0 with a radius 3. The main wing, using aerofoil RAE 2822 data, lies between the origin and the centre of the circle, while the secondary aerofoil is produced from the first by performing a translation, a scale reduction and a rotation. 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 aerofoils.
The boundary mesh has 296 vertices and 296 edges (see Section 10.3 top). Note that the particular mesh generated could be sensitive to the machine precision and therefore may differ from one implementation to another. The interior meshes for different values of NPROPA are given in Section 10.3.

10.1  Program Text

Program Text (d06abfe.f90)

10.2  Program Data

Program Data (d06abfe.d)

10.3  Program Results

Program Results (d06abfe.r)

GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Example Program Geometry for Generating Meshes gnuplot_plot_1
GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Mesh Generated Using Arithmetic Coefficient ω=1.2 gnuplot_plot_1
GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Mesh Generated Using Arithmetic Coefficient ω=1.0 gnuplot_plot_1
GnuplotProduced by GNUPLOT 4.6 patchlevel 3 Mesh Generated Using Geometric Coefficient ω=1.0 gnuplot_plot_1

D06ABF (PDF version)
D06 Chapter Contents
D06 Chapter Introduction
NAG Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2015