NAG FL Interface
d06abf (dim2_gen_delaunay)
1
Purpose
d06abf generates a triangular mesh of a closed polygonal region in , given a mesh of its boundary. It uses a Delaunay–Voronoi process, based on an incremental method.
2
Specification
Fortran Interface
Subroutine d06abf ( |
nvb, nvint, nvmax, nedge, edge, nv, nelt, coor, conn, weight, npropa, itrace, rwork, lrwork, iwork, liwork, ifail) |
Integer, Intent (In) |
:: |
nvb, nvint, nvmax, nedge, edge(3,nedge), npropa, 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 <nag.h>
void |
d06abf_ (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 *npropa, const Integer *itrace, double rwork[], const Integer *lrwork, Integer iwork[], const Integer *liwork, Integer *ifail) |
|
C++ Header Interface
#include <nag.h> extern "C" {
void |
d06abf_ (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 &npropa, const Integer &itrace, double rwork[], const Integer &lrwork, Integer iwork[], const Integer &liwork, Integer &ifail) |
}
|
The routine may be called by the names d06abf or nagf_mesh_dim2_gen_delaunay.
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
Arguments
-
1:
– Integer
Input
-
On entry: the number of vertices in the input boundary mesh.
Constraint:
.
-
2:
– Integer
Input
-
On entry: the number of fixed interior mesh vertices to which a weight will be applied.
Constraint:
.
-
3:
– Integer
Input
-
On entry: the maximum number of vertices in the mesh to be generated.
Constraint:
.
-
4:
– Integer
Input
-
On entry: the number of boundary edges in the input mesh.
Constraint:
.
-
5:
– Integer array
Input
-
On entry: the specification of the boundary edges. and contain the vertex numbers of the two end points of the th boundary edge. is a user-supplied tag for the th boundary edge and is not used by d06abf.
Constraint:
and , for and .
-
6:
– Integer
Output
-
On exit: the total number of vertices in the output mesh (including both boundary and interior vertices). If , no interior vertices will be generated and .
-
7:
– Integer
Output
-
On exit: the number of triangular elements in the mesh.
-
8:
– Real (Kind=nag_wp) array
Input/Output
-
On entry: contains the coordinate of the th input boundary mesh vertex, for .
contains the coordinate of the th fixed interior vertex, for . For boundary and interior vertices,
contains the corresponding coordinate, for .
On exit: will contain the coordinate of the th generated interior mesh vertex, for ; while will contain the corresponding coordinate. The remaining elements are unchanged.
-
9:
– Integer array
Output
-
On exit: the connectivity of the mesh between triangles and vertices. For each triangle
, gives the indices of its three vertices (in anticlockwise order), for and .
-
10:
– Real (Kind=nag_wp) array
Input
-
Note: the dimension of the array
weight
must be at least
.
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 , , for .
-
11:
– Integer
Input
-
On entry: the propagation type and coefficient, the argument
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:
.
-
12:
– Integer
Input
-
On entry: the level of trace information required from
d06abf.
- 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 , unless you are experienced with finite element mesh generation.
-
13:
– Real (Kind=nag_wp) array
Workspace
-
14:
– Integer
Input
-
On entry: the dimension of the array
rwork as declared in the (sub)program from which
d06abf is called.
Constraint:
.
-
15:
– Integer array
Workspace
-
16:
– Integer
Input
-
On entry: the dimension of the array
iwork as declared in the (sub)program from which
d06abf is called.
Constraint:
.
-
17:
– Integer
Input/Output
-
On entry:
ifail must be set to
,
or
to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of means that an error message is printed while a value of means that it is not.
If halting is not appropriate, the value
or
is recommended. If message printing is undesirable, then the value
is recommended. Otherwise, the value
is recommended.
When the value or is used it is essential to test the value of ifail on exit.
On exit:
unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
-
On entry, , , and .
Constraint: and .
On entry, and .
Constraint: .
On entry, and .
Constraint: .
On entry, .
Constraint: .
On entry, .
On entry, ,
and .
Constraint: .
On entry, .
Constraint: .
On entry, .
Constraint: .
On entry, the end points of the edge have the same index : and .
On entry, and .
Constraint: .
-
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
may provide more details.
-
An error has occurred during the generation of the boundary mesh. It appears that
nvmax is not large enough:
.
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
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.
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:
, where
is the absolute value of
npropa. During the process vertices are generated on edges of the mesh
to obtain the mesh
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
, and arithmetic otherwise. But increasing the value of
may lead to failure of the process, due to precision, especially in geometries with holes. So you are advised to manipulate the argument
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 with a radius . 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
vertices and
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
10.2
Program Data
10.3
Program Results