<?xml-stylesheet type="text/xsl" href="../styles/pmathml.xsl"?>
<!-- saved from url=(0014)about:internet -->
<html xmlns="http://www.w3.org/1999/xhtml" xmlns:dsi="http://www.w3.org/1999/xlink" xmlns:m="http://www.w3.org/1998/Math/MathML" xml:space="preserve"><head><meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"/><title>D06AAF : NAG Library, Mark 22</title><link rel="stylesheet" href="../styles/libdoc.css" type="text/css"/><script type="text/javascript">
   function showLevel(_levelId){
    var thisLevel = document.getElementById(_levelId);
    var thisplus = document.getElementById( _levelId.concat('plus'));
    var thisminus = document.getElementById( _levelId.concat('minus'));
    if(thisLevel.style.display != "block"){
     thisLevel.style.display = "block";
     thisplus.style.display = "none";
     thisminus.style.display = "inline";
     }
    else{
     thisLevel.style.display = "none";
     thisminus.style.display = "none";
     thisplus.style.display = "inline";
     }
    }
  </script></head><body><hr/><div><a class="rout" href="../../pdf/D06/d06aaf.pdf">D06AAF (PDF version)</a></div><div><a class="chap" href="d06conts.xml">D06 Chapter Contents</a></div><div><a class="chapint" href="d06intro.xml">D06 Chapter Introduction</a></div>
<div><a class="htmltoc" href="../FRONTMATTER/manconts.xml">NAG Library Manual</a></div><hr/><h1 class="libdoc">NAG Library Routine Document<br/><br/>D06AAF</h1><div class="paramtext"><div class="header"><b>Note:</b>&#160; before using this routine, please read the Users' Note for your implementation to check the interpretation of <span class="bitalic">bold italicised</span> terms and other implementation-dependent details.</div></div> 
<div class="htmltoc">
<h2 class="htmltoc"><span class="htmltochead" onclick="showLevel('htmltoc');"><span class="htmltocplus" id="htmltocplus">+</span><span class="htmltocminus" id="htmltocminus">&#8722;</span></span>&#160;Contents</h2>
<div class="htmltocitem" id="htmltoc">
<div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#purpose">1&#160;&#160;<b>Purpose</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#specification">2&#160;&#160;<b>Specification</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#description">3&#160;&#160;<b>Description</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#references">4&#160;&#160;<b>References</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#parameters">5&#160;&#160;<b>Parameters</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#errors">6&#160;&#160;<b>Error Indicators and Warnings</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#accuracy">7&#160;&#160;<b>Accuracy</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#fcomments">8&#160;&#160;<b>Further Comments</b></a>
</div><div class="htmltoc">
<span class="htmltoc" onclick="showLevel('tocexample');"><span class="htmltocplus" id="tocexampleplus">+</span><span class="htmltocminus" id="tocexampleminus">&#8722;</span></span>
<a class="htmltoc" href="#example">9&#160;&#160;<b>Example</b></a>
<div class="htmltocitem" id="tocexample">
<div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examtext">9.1&#160;&#160;<b>Program Text</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examdata">9.2&#160;&#160;<b>Program Data</b></a>
</div><div class="htmltoc">
<span class="htmltocplus">&#160;&#160;&#160;</span>
<a class="htmltoc" href="#examresults">9.3&#160;&#160;<b>Program Results</b></a>
</div>
</div>
</div>
</div>
</div><h2 class="standard"><a class="sec" name="purpose" id="purpose"/>1&#160;&#160;Purpose</h2>
<div class="paramtext">D06AAF generates a triangular mesh of a closed polygonal region in <m:math><m:msup><m:mi>&#8477;</m:mi><m:mn>2</m:mn></m:msup></m:math>, given a mesh of its boundary.  It uses a simple incremental method.</div><h2 class="standard"><a class="sec" name="specification" id="specification"/>2&#160;&#160;Specification</h2>
<table class="fspec"><tr><td class="tdfspec1">SUBROUTINE&#160;D06AAF&#160;(</td><td class="tdfspec2"><a class="arg" href="#NVB">NVB</a>, <a class="arg" href="#NVMAX">NVMAX</a>, <a class="arg" href="#NEDGE">NEDGE</a>, <a class="arg" href="#EDGE">EDGE</a>, <a class="arg" href="#NV">NV</a>, <a class="arg" href="#NELT">NELT</a>, <a class="arg" href="#COOR">COOR</a>, <a class="arg" href="#CONN">CONN</a>, <a class="arg" href="#BSPACE">BSPACE</a>, <a class="arg" href="#SMOOTH">SMOOTH</a>, <a class="arg" href="#COEF">COEF</a>, <a class="arg" href="#POWER">POWER</a>, <a class="arg" href="#ITRACE">ITRACE</a>, <a class="arg" href="#RWORK">RWORK</a>, <a class="arg" href="#LRWORK">LRWORK</a>, <a class="arg" href="#IWORK">IWORK</a>, <a class="arg" href="#LIWORK">LIWORK</a>, <a class="arg" href="#IFAIL">IFAIL</a>)</td></tr><tr><td class="tdfspec1">INTEGER</td><td class="tdfspec2">NVB, NVMAX, NEDGE, EDGE(3,NEDGE), NV, NELT, CONN(3,2*(NVMAX-1)), ITRACE, LRWORK, IWORK(LIWORK), LIWORK, IFAIL</td></tr><tr><td class="tdfspec1"><b><i>double&#160;precision</i></b></td><td class="tdfspec2">COOR(2,NVMAX), BSPACE(NVB), COEF, POWER, RWORK(LRWORK)</td></tr><tr><td class="tdfspec1">LOGICAL</td><td class="tdfspec2">SMOOTH</td></tr></table><h2 class="standard"><a class="sec" name="description" id="description"/>3&#160;&#160;Description</h2>
<div class="paramtext">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 <a class="chapint" href="../D06/d06intro.xml">D06 Chapter Introduction</a> as well as <a class="ref" href="#ref698">George and Borouchaki (1998)</a>.</div><div class="paramtext">This routine is derived from material in the MODULEF package from INRIA (Institut National de Recherche en Informatique et Automatique).</div><h2 class="standard"><a class="sec" name="references" id="references"/>4&#160;&#160;References</h2><div class="paramtext"><a name="ref698" id="ref698"/>George P L and Borouchaki H (1998)  <i>Delaunay Triangulation and Meshing: Application to Finite Elements</i> Editions HERMES, Paris </div><h2 class="standard"><a class="sec" name="parameters" id="parameters"/>5&#160;&#160;Parameters</h2>
<dl><dt class="paramhead"><a name="NVB" id="NVB"/>1: &#160;&#160;&#8194; NVB &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: 

the number of vertices in the input boundary mesh.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:mn>3</m:mn><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction></m:math>.
</div></dd><dt class="paramhead"><a name="NVMAX" id="NVMAX"/>2: &#160;&#160;&#8194; NVMAX &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: 

the maximum number of vertices in the mesh to be generated.</div></dd><dt class="paramhead"><a name="NEDGE" id="NEDGE"/>3: &#160;&#160;&#8194; NEDGE &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: 

the number of boundary edges in the input mesh.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="EDGE" id="EDGE"/>4: &#160;&#160;&#8194; EDGE(<m:math><m:mn>3</m:mn></m:math>,<a class="arg" href="#NEDGE">NEDGE</a>) &#8211; INTEGER array<span class="pclass">Input</span></dt><dd>
<div class="paramtext"><i>On entry</i>: the specification of the boundary edges.  <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn><m:mi>j</m:mi></m:mfenced></m:mrow></m:math>&#160;and <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>2</m:mn><m:mi>j</m:mi></m:mfenced></m:mrow></m:math>&#160;contain the vertex numbers of the two end points of the <m:math><m:mi>j</m:mi></m:math>th boundary edge. <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>3</m:mn><m:mi>j</m:mi></m:mfenced></m:mrow></m:math>&#160;is a user-supplied tag for the <m:math><m:mi>j</m:mi></m:math>th boundary edge and is not used by D06AAF. </div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:mn>1</m:mn><m:mo>&#8804;</m:mo><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi mathvariant="italic">i</m:mi><m:mi mathvariant="italic">j</m:mi></m:mfenced></m:mrow><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>&#160;and <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn><m:mi mathvariant="italic">j</m:mi></m:mfenced></m:mrow><m:mo>&#8800;</m:mo><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>2</m:mn><m:mi mathvariant="italic">j</m:mi></m:mfenced></m:mrow></m:math>,  for <m:math><m:mi mathvariant="italic">i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn></m:math> and <m:math><m:mi mathvariant="italic">j</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction></m:math>.</div></dd><dt class="paramhead"><a name="NV" id="NV"/>5: &#160;&#160;&#8194; NV &#8211; INTEGER<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: the total number of vertices in the output mesh (including both boundary and interior vertices). If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction><m:mo>=</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction></m:math>, no interior vertices will be generated and <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NV"><m:mi mathcolor="#EE0000" mathvariant="bold">NV</m:mi></m:maction><m:mo>=</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>.</div></dd><dt class="paramhead"><a name="NELT" id="NELT"/>6: &#160;&#160;&#8194; NELT &#8211; INTEGER<span class="pclass">Output</span></dt><dd><div class="paramtext"><i>On exit</i>: the number of triangular elements in the mesh.</div></dd><dt class="paramhead"><a name="COOR" id="COOR"/>7: &#160;&#160;&#8194; COOR(<m:math><m:mn>2</m:mn></m:math>,<a class="arg" href="#NVMAX">NVMAX</a>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Input/Output</span></dt><dd>
<div class="paramtext"><i>On entry</i>: <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#COOR"><m:mi mathcolor="#EE0000" mathvariant="bold">COOR</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn><m:mi>i</m:mi></m:mfenced></m:mrow></m:math>&#160;contains the <m:math><m:mi>x</m:mi></m:math>&#160;co-ordinate of the <m:math><m:mi>i</m:mi></m:math>th input boundary mesh vertex; while <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#COOR"><m:mi mathcolor="#EE0000" mathvariant="bold">COOR</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>2</m:mn><m:mi>i</m:mi></m:mfenced></m:mrow></m:math>&#160;contains the corresponding <m:math><m:mi>y</m:mi></m:math>&#160;co-ordinate, for <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>.</div>
<div class="paramtext"><i>On exit</i>: <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#COOR"><m:mi mathcolor="#EE0000" mathvariant="bold">COOR</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn><m:mi>i</m:mi></m:mfenced></m:mrow></m:math>&#160;will contain the <m:math><m:mi>x</m:mi></m:math>&#160;co-ordinate of the <m:math><m:mfenced separators=""><m:mi>i</m:mi><m:mo>-</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:mfenced></m:math>th generated interior mesh vertex; while <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#COOR"><m:mi mathcolor="#EE0000" mathvariant="bold">COOR</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>2</m:mn><m:mi>i</m:mi></m:mfenced></m:mrow></m:math>&#160;will contain the corresponding <m:math><m:mi>y</m:mi></m:math>&#160;co-ordinate, for <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction><m:mo>+</m:mo><m:mn>1</m:mn></m:mrow><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NV"><m:mi mathcolor="#EE0000" mathvariant="bold">NV</m:mi></m:maction></m:math>. The remaining elements are unchanged.</div></dd><dt class="paramhead"><a name="CONN" id="CONN"/>8: &#160;&#160;&#8194; CONN(<m:math><m:mn>3</m:mn></m:math>,<m:math><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:mfenced separators=""><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction><m:mo>-</m:mo><m:mn>1</m:mn></m:mfenced></m:math>) &#8211; INTEGER array<span class="pclass">Output</span></dt><dd>
<div class="paramtext"><i>On exit</i>: the connectivity of the mesh between triangles and vertices. For each triangle <m:math><m:mi>j</m:mi></m:math>, <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#CONN"><m:mi mathcolor="#EE0000" mathvariant="bold">CONN</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi>i</m:mi><m:mi>j</m:mi></m:mfenced></m:mrow></m:math>&#160;gives the indices of its three vertices (in anticlockwise order), for <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn></m:math>, <m:math><m:mn>2</m:mn></m:math>&#160;and <m:math><m:mn>3</m:mn></m:math>, and  <m:math><m:mi>j</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NELT"><m:mi mathcolor="#EE0000" mathvariant="bold">NELT</m:mi></m:maction></m:math>. </div></dd><dt class="paramhead"><a name="BSPACE" id="BSPACE"/>9: &#160;&#160;&#8194; BSPACE(<a class="arg" href="#NVB">NVB</a>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the desired mesh spacing (triangle diameter, which is the length of the longer edge of the triangle) near the boundary vertices.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#BSPACE"><m:mi mathcolor="#EE0000" mathvariant="bold">BSPACE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi mathvariant="italic">i</m:mi></m:mfenced></m:mrow><m:mo>&gt;</m:mo><m:mn>0.0</m:mn></m:math>,  for <m:math><m:mi mathvariant="italic">i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>.</div></dd><dt class="paramhead"><a name="SMOOTH" id="SMOOTH"/>10: &#8194; SMOOTH &#8211; LOGICAL<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: indicates whether or not mesh smoothing should be performed. 
<div class="paramtext">If <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#SMOOTH"><m:mi mathcolor="#EE0000" mathvariant="bold">SMOOTH</m:mi></m:maction><m:mo>=</m:mo><m:mi mathvariant="normal">.TRUE.</m:mi></m:math>, the smoothing is performed; otherwise no smoothing is performed.</div>
</div></dd><dt class="paramhead"><a name="COEF" id="COEF"/>11: &#8194; COEF &#8211; <span class="bitalic">double precision</span><span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the coefficient in the stopping criteria for the generation of interior vertices. This parameter controls the triangle density and the number of triangles generated is in <m:math><m:mrow><m:mi mathvariant="italic">O</m:mi><m:mfenced separators=""><m:msup><m:maction actiontype="link" dsi:type="simple" dsi:href="#COEF"><m:mi mathcolor="#EE0000" mathvariant="bold">COEF</m:mi></m:maction><m:mn>2</m:mn></m:msup></m:mfenced></m:mrow></m:math>. The mesh will be finer if <a class="arg" href="#COEF">COEF</a> is greater than <m:math><m:mn>0.7165</m:mn></m:math>&#160;and <m:math><m:mn>0.75</m:mn></m:math>&#160;is a good value.</div>
<div class="paramtext"><i>Suggested value</i>:
  <m:math><m:mn>0.75</m:mn></m:math>.

</div></dd><dt class="paramhead"><a name="POWER" id="POWER"/>12: &#8194; POWER &#8211; <span class="bitalic">double precision</span><span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: controls the rate of change of the mesh size during the generation of interior vertices. The smaller the value of <a class="arg" href="#POWER">POWER</a>, the faster the decrease in element size away from the boundary.</div>
<div class="paramtext"><i>Suggested value</i>:
  <m:math><m:mn>0.25</m:mn></m:math>.

</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:mn>0.1</m:mn><m:mo>&#8804;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#POWER"><m:mi mathcolor="#EE0000" mathvariant="bold">POWER</m:mi></m:maction><m:mo>&#8804;</m:mo><m:mn>10.0</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="ITRACE" id="ITRACE"/>13: &#8194; ITRACE &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the level of trace information required from D06AAF.

<dl>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITRACE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITRACE</m:mi></m:maction><m:mo>&#8804;</m:mo><m:mn>0</m:mn></m:math></dt>
<dd>No output is generated.</dd>
<dt class="paramval"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITRACE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITRACE</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>1</m:mn></m:math></dt>
<dd>Output from the meshing solver is printed on the current advisory message unit (see <a class="rout" href="../X04/x04abf.xml">X04ABF</a>). This output contains details of the vertices and triangles generated by the process.</dd></dl>
<div class="paramtext">You are advised to set <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITRACE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITRACE</m:mi></m:maction><m:mo>=</m:mo><m:mn>0</m:mn></m:math>, unless you are experienced with finite element mesh generation.</div>
</div></dd><dt class="paramhead"><a name="RWORK" id="RWORK"/>14: &#8194; RWORK(<a class="arg" href="#LRWORK">LRWORK</a>) &#8211; <span class="bitalic">double precision</span> array<span class="pclass">Workspace</span></dt><dt class="multi-paramhead"><a name="LRWORK" id="LRWORK"/>15: &#8194; LRWORK &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the dimension of the array <a class="arg" href="#RWORK">RWORK</a> as declared in the (sub)program from which D06AAF is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LRWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LRWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction></m:math>.
</div></dd><dt class="paramhead"><a name="IWORK" id="IWORK"/>16: &#8194; IWORK(<a class="arg" href="#LIWORK">LIWORK</a>) &#8211; INTEGER array<span class="pclass">Workspace</span></dt><dt class="multi-paramhead"><a name="LIWORK" id="LIWORK"/>17: &#8194; LIWORK &#8211; INTEGER<span class="pclass">Input</span></dt><dd><div class="paramtext"><i>On entry</i>: the dimension of the array <a class="arg" href="#IWORK">IWORK</a> as declared in the (sub)program from which D06AAF is called.</div><div class="paramtext"><i>Constraint</i>:
  <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>&#8805;</m:mo><m:mn>16</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction><m:mo>+</m:mo><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction><m:mo>+</m:mo><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mrow><m:mn>4</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction><m:mo>+</m:mo><m:mn>2</m:mn></m:mrow><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction></m:mfenced></m:mrow><m:mo>-</m:mo><m:mn>14</m:mn></m:math>.
</div></dd><dt class="paramhead"><a name="IFAIL" id="IFAIL"/>18: &#8194; IFAIL &#8211; INTEGER<span class="pclass">Input/Output</span></dt><dd>
<div class="paramtext"><i>On entry</i>: <a class="arg" href="#IFAIL">IFAIL</a> must be set to <m:math><m:mn>0</m:mn></m:math>, <m:math><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow><m:mtext>&#8203; or &#8203;</m:mtext><m:mn>1</m:mn></m:math>. If you are unfamiliar with this parameter you should refer to <a class="sec" href="../GENINT/essint.xml#library3">Section 3.3</a> in  the Essential Introduction for details.</div>
<div class="paramtext"><i>On exit</i>: <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFAIL"><m:mi mathcolor="#EE0000" mathvariant="bold">IFAIL</m:mi></m:maction><m:mo>=</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#errors"><m:mn mathcolor="#003399" mathvariant="bold">0</m:mn></m:maction></m:math>&#160;unless the routine detects an error (see <a class="sec" href="#errors">Section 6</a>). <div class="paramtext">For environments where it might be inappropriate to halt program execution when an error is detected, the value <m:math><m:mrow><m:mo>-</m:mo><m:mn>1</m:mn></m:mrow><m:mtext>&#8203; or &#8203;</m:mtext><m:mn>1</m:mn></m:math>&#160;is recommended.  If the output of error messages is undesirable, then the value <m:math><m:mn>1</m:mn></m:math>&#160;is recommended.  Otherwise, if you are not familiar with this parameter, the recommended value is <m:math><m:mn>0</m:mn></m:math>.  <b>When the value <m:math><m:mrow><m:mo>-</m:mo><m:mn mathvariant="bold">1</m:mn></m:mrow><m:mtext>&#8203; or &#8203;</m:mtext><m:mn mathvariant="bold">1</m:mn></m:math>&#160;is used it is essential to test the value of <a class="arg" href="#IFAIL">IFAIL</a> on exit.</b></div></div></dd></dl><h2 class="standard"><a class="sec" name="errors" id="errors"/>6&#160;&#160;Error Indicators and Warnings</h2>
<div class="paramtext">If on entry <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFAIL"><m:mi mathcolor="#EE0000" mathvariant="bold">IFAIL</m:mi></m:maction><m:mo>=</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#errors"><m:mn mathcolor="#003399" mathvariant="bold">0</m:mn></m:maction></m:math>&#160;or <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#errors"><m:mn mathcolor="#003399" mathvariant="bold">-1</m:mn></m:maction></m:math>, explanatory error messages are output on the current error message unit (as defined by <a class="rout" href="../X04/x04aaf.xml">X04AAF</a>).</div><div class="paramtext">Errors or warnings detected by the routine:</div>
<dl class="ifail">
<dt class="errorhead"><a name="IFeq1" id="IFeq1"/><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFAIL"><m:mi mathcolor="#EE0000" mathvariant="bold">IFAIL</m:mi></m:maction><m:mo>=</m:mo><m:mn>1</m:mn></m:math></dt>
<dd>
<table class="ifail"><tr><td class="ifail1">On&#160;entry,</td><td class="ifail2-90"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>3</m:mn></m:math>&#160;or <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction><m:mo>&gt;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>1</m:mn></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi>i</m:mi><m:mi>j</m:mi></m:mfenced></m:mrow><m:mo>&lt;</m:mo><m:mn>1</m:mn></m:math>&#160;or  <m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi>i</m:mi><m:mi>j</m:mi></m:mfenced></m:mrow><m:mo>&gt;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>, for some <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn></m:math>&#160;and <m:math><m:mi>j</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>1</m:mn><m:mi>j</m:mi></m:mfenced></m:mrow><m:mo>=</m:mo><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#EDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">EDGE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mn>2</m:mn><m:mi>j</m:mi></m:mfenced></m:mrow></m:math>, for some <m:math><m:mi>j</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:mrow><m:maction actiontype="link" dsi:type="simple" dsi:href="#BSPACE"><m:mi mathcolor="#EE0000" mathvariant="bold">BSPACE</m:mi></m:maction><m:mfenced separators="," open="(" close=")"><m:mi>i</m:mi></m:mfenced></m:mrow><m:mo>&#8804;</m:mo><m:mn>0.0</m:mn></m:math>, for some <m:math><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mn>2</m:mn><m:mo>,</m:mo><m:mo>&#8230;</m:mo><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVB"><m:mi mathcolor="#EE0000" mathvariant="bold">NVB</m:mi></m:maction></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#POWER"><m:mi mathcolor="#EE0000" mathvariant="bold">POWER</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>0.1</m:mn></m:math>&#160;or <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#POWER"><m:mi mathcolor="#EE0000" mathvariant="bold">POWER</m:mi></m:maction><m:mo>&gt;</m:mo><m:mn>10.0</m:mn></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LIWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LIWORK</m:mi></m:maction><m:mo>&lt;</m:mo><m:mn>16</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction><m:mo>+</m:mo><m:mn>2</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction><m:mo>+</m:mo><m:mrow><m:mi>max</m:mi><m:mspace width="0.125em"/><m:mfenced separators=""><m:mrow><m:mn>4</m:mn><m:mo>&#215;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction><m:mo>+</m:mo><m:mn>2</m:mn></m:mrow><m:mo>,</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NEDGE"><m:mi mathcolor="#EE0000" mathvariant="bold">NEDGE</m:mi></m:maction></m:mfenced></m:mrow><m:mo>-</m:mo><m:mn>14</m:mn></m:math>,</td></tr><tr><td class="ifail1">or</td><td class="ifail2-90"><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#LRWORK"><m:mi mathcolor="#EE0000" mathvariant="bold">LRWORK</m:mi></m:maction><m:mo>&lt;</m:mo><m:maction actiontype="link" dsi:type="simple" dsi:href="#NVMAX"><m:mi mathcolor="#EE0000" mathvariant="bold">NVMAX</m:mi></m:maction></m:math>.</td></tr></table>
</dd>
</dl><dl class="ifail">
<dt class="errorhead"><a name="IFeq2" id="IFeq2"/><m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#IFAIL"><m:mi mathcolor="#EE0000" mathvariant="bold">IFAIL</m:mi></m:maction><m:mo>=</m:mo><m:mn>2</m:mn></m:math></dt>
<dd>
<div class="paramtext">An error has occurred during the generation of the interior mesh.  Check the definition of the boundary (arguments <a class="arg" href="#COOR">COOR</a> and <a class="arg" href="#EDGE">EDGE</a>) as well as the orientation of the boundary (especially in the case of a multiple connected component boundary).  Setting <m:math><m:maction actiontype="link" dsi:type="simple" dsi:href="#ITRACE"><m:mi mathcolor="#EE0000" mathvariant="bold">ITRACE</m:mi></m:maction><m:mo>&gt;</m:mo><m:mn>0</m:mn></m:math>&#160;may provide more details.</div>
</dd>
</dl><h2 class="standard"><a class="sec" name="accuracy" id="accuracy"/>7&#160;&#160;Accuracy</h2>
<div class="paramtext">Not applicable.</div><h2 class="standard"><a class="sec" name="fcomments" id="fcomments"/>8&#160;&#160;Further Comments</h2>
<div class="paramtext">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 <a class="arg" href="#NVMAX">NVMAX</a>, <a class="arg" href="#BSPACE">BSPACE</a>, <a class="arg" href="#COEF">COEF</a> and <a class="arg" href="#POWER">POWER</a>.  But you are advised to manipulate the last two parameters with care.</div><div class="paramtext">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 <b>clockwise</b> order and opposite to that of the exterior boundary.  If the boundary has only one connected component, its orientation should be <b>anticlockwise</b>.</div><h2 class="standard"><a class="sec" name="example" id="example"/>9&#160;&#160;Example</h2>
<div class="paramtext">In this example, a geometry with two holes (two interior circles inside an exterior one) is meshed using the simple incremental method (see the <a class="chapint" href="../D06/d06intro.xml">D06 Chapter Introduction</a>).  The exterior circle is centred at the origin with a radius <m:math><m:mn>1.0</m:mn></m:math>, the first interior circle is centred at the point <m:math><m:mfenced separators=""><m:mrow><m:mo>-</m:mo><m:mn>0.5</m:mn></m:mrow><m:mo>,</m:mo><m:mn>0.0</m:mn></m:mfenced></m:math>&#160;with a radius <m:math><m:mn>0.49</m:mn></m:math>, and the second one is centred at the point <m:math><m:mfenced separators=""><m:mrow><m:mo>-</m:mo><m:mn>0.5</m:mn></m:mrow><m:mo>,</m:mo><m:mn>0.65</m:mn></m:mfenced></m:math>&#160;with a radius <m:math><m:mn>0.15</m:mn></m:math>.  Note that the points <m:math><m:mfenced separators=""><m:mrow><m:mo>-</m:mo><m:mn>1.0</m:mn></m:mrow><m:mo>,</m:mo><m:mn>0.0</m:mn></m:mfenced></m:math>&#160;and <m:math><m:mfenced separators=""><m:mrow><m:mo>-</m:mo><m:mn>0.5</m:mn></m:mrow><m:mo>,</m:mo><m:mn>0.5</m:mn></m:mfenced></m:math>) are points of &#8216;near tangency&#8217; between the exterior circle and the first and second circles.</div><div class="paramtext">The boundary mesh has <m:math><m:mn>100</m:mn></m:math>&#160;vertices and <m:math><m:mn>100</m:mn></m:math>&#160;edges (see <a class="fig" href="#FIG1">Figure 1</a>).  Note that the particular mesh generated could be sensitive to the <span class="bitalic">machine precision</span> and therefore may differ from one implementation to another.  <a class="fig" href="#FIG2">Figure 2</a> contains the output mesh.</div><h3 class="standard"><a class="sec" name="examtext" id="examtext"/>9.1&#160;&#160;Program Text</h3>
<p><a class="verbatimref" href="../../examples/source/d06aafe.f">Program Text (d06aafe.f)</a></p><h3 class="standard"><a class="sec" name="examdata" id="examdata"/>9.2&#160;&#160;Program Data</h3>
<p><a class="verbatimref" href="../../examples/data/d06aafe.d">Program&#160;Data (d06aafe.d)</a></p><h3 class="standard"><a class="sec" name="examresults" id="examresults"/>9.3&#160;&#160;Program Results</h3>
<p><a class="verbatimref" href="../../examples/baseresults/d06aafe.r">Program Results (d06aafe.r)</a></p><div class="paramtext">
<div class="figure"><a name="FIG1" id="FIG1"/><img src="../figures/D06AAF1fl20.png" style="height: 21em" alt="The boundary mesh of the geometry with two holes"/></div><div class="figure"><b>Figure 1: The boundary mesh of the geometry with two holes</b></div>
</div><div class="paramtext">
<div class="figure"><a name="FIG2" id="FIG2"/><img src="../figures/D06AAF2fl20.png" style="height: 21em" alt="Interior mesh of the geometry with two holes"/></div><div class="figure"><b>Figure 2: Interior mesh of the geometry with two holes</b></div>
</div>
<hr/><div><a class="rout" href="../../pdf/D06/d06aaf.pdf">D06AAF (PDF version)</a></div><div><a class="chap" href="d06conts.xml">D06 Chapter Contents</a></div><div><a class="chapint" href="d06intro.xml">D06 Chapter Introduction</a></div>
<div><a class="htmltoc" href="../FRONTMATTER/manconts.xml">NAG Library Manual</a></div>
<div><hr/><a class="genint" href="../FRONTMATTER/copyright.xml">&#169; The Numerical Algorithms Group Ltd, Oxford, UK. 2009</a></div></body></html>
