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

NAG Library Routine Document

D06ACF

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
    2  Specification
    3  Description
    4  References
    5  Parameters
    6  Error Indicators and Warnings
    7  Accuracy
    8  Further Comments
+− 9  Example

1  Purpose

D06ACF generates a triangular mesh of a closed polygonal region in ℝ2, given a mesh of its boundary. It uses an Advancing Front process, based on an incremental method.

2  Specification

SUBROUTINE D06ACF (NVB, NVINT, NVMAX, NEDGE, EDGE, NV, NELT, COOR, CONN, WEIGHT, ITRACE, RWORK, LRWORK, IWORK, LIWORK, IFAIL)
INTEGERNVB, NVINT, NVMAX, NEDGE, EDGE(3,NEDGE), NV, NELT, CONN(3,2*NVMAX+5), ITRACE, LRWORK, IWORK(LIWORK), LIWORK, IFAIL
double precisionCOOR(2,NVMAX), WEIGHT(*), RWORK(LRWORK)

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  Parameters

1:     NVB – INTEGERInput
On entry: the number of vertices in the input boundary mesh.
Constraint: NVB≥3.
2:     NVINT – INTEGERInput
On entry: the number of fixed interior mesh vertices to which a weight will be applied.
Constraint: NVINT≥0.
3:     NVMAX – INTEGERInput
On entry: the maximum number of vertices in the mesh to be generated.
Constraint: NVMAX≥NVB+NVINT.
4:     NEDGE – INTEGERInput
On entry: the number of boundary edges in the input mesh.
Constraint: NEDGE≥1.
5:     EDGE(3,NEDGE) – 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 D06ACF.
Constraint: 1≤EDGEij≤NVB and EDGE1j≠EDGE2j, 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:     COOR(2,NVMAX) – double precision arrayInput/Output
On entry: COOR1i contains the x co-ordinate of the ith input boundary mesh vertex, for i=1,…,NVB. COOR1i contains the x co-ordinate of the i-NVBth fixed interior vertex, for i=NVB+1,…,NVB+NVINT. For boundary and interior vertices, COOR2i contains the corresponding y co-ordinate, for i=1,2,…,NVB+NVINT.
On exit: COOR1i will contain the x co-ordinate of the i-NVB-NVINTth generated interior mesh vertex, for i=NVB+NVINT+1,…,NV; while COOR2i will contain the corresponding y co-ordinate. The remaining elements are unchanged.
9:     CONN(3,2×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 and 3, and j=1,…,NELT.
10:   WEIGHT(*) – double precision 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:   ITRACE – INTEGERInput
On entry: the level of trace information required from D06ACF.
ITRACE≤0
No output is generated.
ITRACE≥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 ITRACE=0, unless you are experienced with finite element mesh generation.
12:   RWORK(LRWORK) – double precision arrayWorkspace
13:   LRWORK – INTEGERInput
On entry: the dimension of the array RWORK as declared in the (sub)program from which D06ACF is called.
Constraint: LRWORK≥12×NVMAX+30015.
14:   IWORK(LIWORK) – INTEGER arrayWorkspace
15:   LIWORK – INTEGERInput
On entry: the dimension of the array IWORK as declared in the (sub)program from which D06ACF is called.
Constraint: LIWORK≥8×NEDGE+53×NVMAX+2×NVB+10078.
16:   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.
On exit: IFAIL=0 unless the routine detects an error (see Section 6).
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.

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,
orif NVINT>0, WEIGHTi≤0.0, for some i=1,2,…,NVINT;
orLRWORK<12×NVMAX+30015,
orLIWORK<8×NEDGE+53×NVMAX+2×NVB+10078.
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.

7  Accuracy

Not applicable.

8  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. 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)).
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.

9  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.5,0.0 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 0.8,-0.3. 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. Contains the generated mesh Figure 1.

9.1  Program Text

Program Text (d06acfe.f)

9.2  Program Data

Program Data (d06acfe.d)

9.3  Program Results

Program Results (d06acfe.r)

The boundary mesh (top), the interior mesh (bottom) of a double wing inside a circle geometry
Figure 1: The boundary mesh (top), the interior mesh (bottom) of a
double wing inside a circle geometry
D06ACF (PDF version)
D06 Chapter Contents
D06 Chapter Introduction
NAG Library Manual
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009