<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.12"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>DFNgen: domain.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">DFNgen
   &#160;<span id="projectnumber">2.0</span>
   </div>
   <div id="projectbrief">DFN Model Generator</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.12 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
$(function() {
  initMenu('',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('domain_8cpp_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">domain.cpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="domain_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="domain_8h.html">domain.h</a>&quot;</span></div><div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="input_8h.html">input.h</a>&quot;</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="structures_8h.html">structures.h</a>&quot;</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="vector_functions_8h.html">vectorFunctions.h</a>&quot;</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;</div><div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment">/******************************************************************************/</span></div><div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment">/***********************  Domain Truncation  **********************************/</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment">// NOTE: domainTruncation() may benefit from rewriting in a more </span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment">//       efficient way which does not reallocate memory as often</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment">// Truncates polygons along the defined domain (&#39;domainSize&#39; in input file)</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment">// Arg 1: Polygon being truncated (if truncation is necessary)</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment">// Arg 2: Point to domain size array, 3 doubles: {x, y, z}</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment">// Return:  0 - If Poly is inside domain and was truncated to more than 2 vertices,</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">//              of poly truncation was not needed</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">//          1 - If rejected due to being outside the domain or was truncated to</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment">//              less than 3 vertices</span></div><div class="line"><a name="l00019"></a><span class="lineno"><a class="line" href="domain_8h.html#aed3d77c17f33d2024704b479d0885332">   19</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="domain_8cpp.html#aed3d77c17f33d2024704b479d0885332">domainTruncation</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <span class="keywordtype">double</span> *<a class="code" href="input_8h.html#a5cd62663cb067d79183d8de4dd0224db">domainSize</a>) {</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;        </div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;    std::vector&lt;double&gt; points; </div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;    points.reserve(18); <span class="comment">// Initialize with enough room for 6 vertices</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;    <span class="keywordtype">int</span> nNodes;    </div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;    </div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;    <span class="keywordtype">double</span> domainX = domainSize[0]*.5; </div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keywordtype">double</span> domainY = domainSize[1]*.5; </div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keywordtype">double</span> domainZ = domainSize[2]*.5;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;    </div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;    <span class="keywordtype">int</span> stop = newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    </div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;    <span class="comment">// Check if truncation is necessay:</span></div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; stop; k++) {</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">int</span> idx = k*3;</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   &gt; domainX || newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   &lt; -domainX) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] &gt; domainY || newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] &lt; -domainY) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] &gt; domainZ || newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] &lt; -domainZ) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;            </div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;        <span class="comment">// If finished checking last node and code still hasn&#39;t broke </span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;        <span class="comment">// from the for loop, then all nodes are inside domain</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordflow">if</span> (k + 1 == stop) {</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;            <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;        }    </div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    }</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    </div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="comment">// If code does not return above, truncation is needed/</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    newPoly.<a class="code" href="struct_poly.html#a341a2ec25f71c2f58c1af119b3990387">truncated</a> = 1; <span class="comment">// Mark poly as truncated    </span></div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    </div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="keywordtype">int</span> nVertices;   <span class="comment">// Same as newPoly.numberOfNodes;</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <span class="keywordtype">double</span> ntmp[3];  <span class="comment">// Normal of domain side</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keywordtype">double</span> pttmp[3]; <span class="comment">// Center point on domain side</span></div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    <span class="comment">// Check against the all the walls of the domain</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keywordflow">for</span> ( <span class="keywordtype">int</span> j = 0; j &lt; 6; j++) {        </div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        </div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;        <span class="keywordflow">switch</span>(j) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;            <span class="keywordflow">case</span> 0: </div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;                ntmp[0]  = 0;  ntmp[1] = 0;  ntmp[2] = 1;</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;                pttmp[0] = 0; pttmp[1] = 0; pttmp[2] = domainZ;</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;            <span class="keywordflow">case</span> 1:</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;                ntmp[0]  = 0;  ntmp[1] = 0;  ntmp[2] = -1;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;                pttmp[0] = 0; pttmp[1] = 0; pttmp[2] = -domainZ;</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keywordflow">case</span> 2:</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;                ntmp[0]  = 0;  ntmp[1] = 1;        ntmp[2] = 0;</div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;                pttmp[0] = 0; pttmp[1] = domainY; pttmp[2] = 0;            </div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;            <span class="keywordflow">case</span> 3:</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;                ntmp[0]  = 0;  ntmp[1] = -1;        ntmp[2] = 0;</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;                pttmp[0] = 0; pttmp[1] = -domainY; pttmp[2] = 0;</div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;            <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;                ntmp[0]  = 1;        ntmp[1] = 0;  ntmp[2] = 0;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;                pttmp[0] = domainX; pttmp[1] = 0; pttmp[2] = 0;</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;            <span class="keywordflow">case</span> 5:</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;                ntmp[0]  = -1;        ntmp[1] = 0;  ntmp[2] = 0;</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;                pttmp[0] = -domainX; pttmp[1] = 0; pttmp[2] = 0;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        }</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        </div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        nVertices = newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="keywordflow">if</span>(nVertices &lt;= 0) {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;            <span class="keywordflow">return</span> 1; <span class="comment">// Reject</span></div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;        }</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    </div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;        nNodes = 0;     <span class="comment">// Counter for final number of nodes</span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        points.clear(); <span class="comment">// Clear any points from last iteration</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        </div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordtype">int</span> last = (nVertices-1)*3; <span class="comment">// Index to last node starting position in array</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordtype">double</span> temp[3];</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;        temp[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last]   - pttmp[0]; <span class="comment">//x</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        temp[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+1] - pttmp[1]; <span class="comment">//y    </span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        temp[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+2] - pttmp[2]; <span class="comment">//z</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    </div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        <span class="comment">// Previous distance - the dot product of the domain side normal</span></div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="comment">// and the distance between vertex number nVertices and the temp point on the</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        <span class="comment">// domain side.                         </span></div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        <span class="keywordtype">double</span> prevdist = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(temp, ntmp);</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; nVertices; i++) {</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        <span class="keywordtype">int</span> index = i*3; </div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        temp[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index]   - pttmp[0];</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        temp[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1] - pttmp[1];</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        temp[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2] - pttmp[2]; </div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        </div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        <span class="comment">// Current distance, the dot product of domain side normal and </span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="comment">// the distance between the ii&#39;th vertex and the temporary point</span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        <span class="keywordtype">double</span> currdist = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(temp, ntmp);</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        <span class="keywordflow">if</span> (currdist &lt;= 0) { <span class="comment">// if vertex is towards the domain relative to the domain side</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;            <span class="comment">// Save vertex</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;            points.push_back(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index]);   <span class="comment">// x</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;            points.push_back(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1]); <span class="comment">// y</span></div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;            points.push_back(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2]); <span class="comment">// z</span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;            nNodes++;</div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;        }</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;</div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keywordflow">if</span> (currdist * prevdist &lt; 0) { <span class="comment">//if crosses boundary</span></div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;            nNodes++;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;            </div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;            <span class="keywordflow">if</span> (i == 0) { <span class="comment">// Store point on boundary</span></div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;                <span class="comment">// &#39;last&#39; is index to last vertice</span></div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;                temp[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last]  </div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[0] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last])  </div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;                        * std::abs(prevdist)/(std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;                temp[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+1] </div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[1] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+1])</div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;                        * std::abs(prevdist)/(std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;                temp[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+2] </div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[2] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[last+2])</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;                        * std::abs(prevdist)/(std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;                points.push_back(temp[0]);</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;                points.push_back(temp[1]);</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;                points.push_back(temp[2]);</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;            }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;            <span class="keywordflow">else</span> { </div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;            </div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                <span class="comment">// If from outside to inside    </span></div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;                temp[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-3] </div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-3]) </div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;                        * std::abs(prevdist) / (std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;                temp[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-2] </div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-2]) </div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                        * std::abs(prevdist) / (std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                temp[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-1] </div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;                        + (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index-1]) </div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;                        * std::abs(prevdist) / (std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;                points.reserve(points.size()+3); <span class="comment">// Resize vector if needed</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;                points.push_back(temp[0]);</div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;                points.push_back(temp[1]);</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;                points.push_back(temp[2]);</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;            }</div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;            <span class="keywordflow">if</span> (currdist &lt; 0) { <span class="comment">// If from outside to inside - swap order</span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;    </div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;                <span class="keywordtype">int</span> tmpIndex = (nNodes-1)*3; <span class="comment">// Index to last saved point</span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;                points[tmpIndex] = points[tmpIndex - 3];                </div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;                points[tmpIndex+1] = points[tmpIndex - 2];    </div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                points[tmpIndex+2] = points[tmpIndex - 1];</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;                points[tmpIndex-3] = temp[0]; </div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;                points[tmpIndex-2] = temp[1];</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;                points[tmpIndex-1] = temp[2];        </div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            }</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;        }</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;        </div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;        prevdist = currdist;</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        </div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        } <span class="comment">// End vertice loops</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;    </div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a> = nNodes;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        <span class="keywordflow">if</span> (nNodes &gt; 0) {</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;    </div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;            <span class="keyword">delete</span>[] newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>;</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;            newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a> = <span class="keyword">new</span> <span class="keywordtype">double</span>[3*nNodes];</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;        </div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            <span class="comment">// Copy new nodes back to newPoly </span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; nNodes; k++) {</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;                <span class="keywordtype">int</span> idxx = k*3;</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idxx]   = points[idxx];</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;                newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idxx+1] = points[idxx+1];</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;                newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idxx+2] = points[idxx+2];</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;            }</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;        }</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;    } <span class="comment">// End main loop</span></div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;    </div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;    <span class="keywordtype">int</span> i = 0;</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;    <span class="keywordflow">while</span> (i &lt; nNodes) {</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;        <span class="keywordtype">int</span> next;</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;        <span class="keywordtype">double</span> temp[3];</div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;        <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    </div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;        <span class="keywordflow">if</span>(i == nNodes-1){ <span class="comment">// If last node</span></div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;            next = 0;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;        }</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;            next = (i+1)*3;</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;        }</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        </div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        temp[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next];</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        temp[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next+1];</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        temp[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] - newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next+2];</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        </div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(temp[0], temp[1], temp[2]) &lt; (2*<a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>)) { <span class="comment">// If distance between current and next vertex &lt; h</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            <span class="comment">// If point is NOT on a boundary, delete current indexed point, ELSE delete next point</span></div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;            <span class="keywordflow">if</span> ( std::abs(std::abs(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx])-domainX) &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp;  std::abs(std::abs(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1])-domainY) &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(std::abs(newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2])-domainZ) &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> ) {                </div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;                </div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;                <span class="comment">// Loop deletes a vertice by shifting elements to the right of the element, to the left </span></div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i; j &lt; nNodes-1 ; j++) {</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;                    <span class="keywordtype">int</span> idx = j*3;</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+3]; <span class="comment">// Shift x coordinate left</span></div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+4]; <span class="comment">// Shift y coordinate left</span></div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+5]; <span class="comment">// Shift z coordinate left</span></div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;                }</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            }    </div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            <span class="keywordflow">else</span> {</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                <span class="comment">// Loop deletes a vertice by shifting elements to the right of the element to the left </span></div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;                <span class="keywordtype">int</span> end = (nNodes-1)*3;</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = next; j &lt; end; j += 3){</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j+3]; <span class="comment">// Shift x coordinate left</span></div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j+1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j+4]; <span class="comment">// Shift y coordinate left</span></div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j+2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[j+5]; <span class="comment">// Shift z coordinate left</span></div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                }</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;            }</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;            nNodes--; <span class="comment">// Update node counter</span></div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;        }</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;            i++;</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        }</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    } <span class="comment">// End while loop</span></div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    </div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;   </div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    <span class="keywordflow">if</span>(nNodes &lt; 3) {</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;        <span class="keywordflow">return</span> 1; <span class="comment">// Reject</span></div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;    }</div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;    </div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;    newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a> = nNodes;</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;    </div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;    <span class="keywordtype">int</span> temp = newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>;</div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; temp; k++){</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        <span class="comment">// Check boundary faces</span></div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;        <span class="comment">// Update which boundaries newPoly touches        </span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        <span class="keywordtype">int</span> idx = k*3;</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx] &gt;= domainX-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[0] = 1;</div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;        }</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx] &lt;= -domainX+<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[1] = 1;</div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        }</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] &gt;= domainY-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[2] = 1;</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        }</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] &lt;= -domainY+<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[3] = 1;</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;        }</div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;</div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] &gt;= domainZ-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[4] = 1;</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;        }</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] &lt;= -domainZ+<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;            newPoly.<a class="code" href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">faces</a>[5] = 1;</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;        }</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;    }</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;}</div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;    </div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;</div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;<span class="comment">/******************************************************************/</span></div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;<span class="comment">/*****************  Debug Print Function  *************************/</span></div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;<span class="comment">// Prints a vector&lt;Point&gt; array to screen</span></div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;<span class="comment">// Arg 1: Vector&lt;Point&gt; array</span></div><div class="line"><a name="l00279"></a><span class="lineno"><a class="line" href="domain_8h.html#a5663d165e5cc1ef6def5cebdc19bc573">  279</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="domain_8cpp.html#a5663d165e5cc1ef6def5cebdc19bc573">printPoints</a>(std::vector&lt;double&gt; &amp;point){</div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; point.size(); i++) {</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;        <span class="keywordflow">if</span> (i != 0 &amp;&amp; i % 3 == 0){</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;            std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;        }</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        std::cout&lt;&lt;point[i]&lt;&lt;<span class="stringliteral">&quot; &quot;</span>;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    }</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;    std::cout&lt;&lt;std::endl;</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;}</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;</div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;</div><div class="ttc" id="vector_functions_8h_html_a92da2058f3ed2a6db16d2fe0e445794a"><div class="ttname"><a href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a></div><div class="ttdeci">T magnitude(T x, T y, T z)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00086">vectorFunctions.h:86</a></div></div>
<div class="ttc" id="input_8h_html"><div class="ttname"><a href="input_8h.html">input.h</a></div></div>
<div class="ttc" id="struct_poly_html_a341a2ec25f71c2f58c1af119b3990387"><div class="ttname"><a href="struct_poly.html#a341a2ec25f71c2f58c1af119b3990387">Poly::truncated</a></div><div class="ttdeci">bool truncated</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00095">structures.h:95</a></div></div>
<div class="ttc" id="struct_poly_html_a8cc8d6067e940d33a1b29844b3e8c6ec"><div class="ttname"><a href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">Poly::numberOfNodes</a></div><div class="ttdeci">int numberOfNodes</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00014">structures.h:14</a></div></div>
<div class="ttc" id="struct_poly_html"><div class="ttname"><a href="struct_poly.html">Poly</a></div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00012">structures.h:12</a></div></div>
<div class="ttc" id="_d_f_nmain_8cpp_html_a974b448c3d0a13d483d36ef15de369b5"><div class="ttname"><a href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a></div><div class="ttdeci">double eps</div><div class="ttdef"><b>Definition:</b> <a href="_d_f_nmain_8cpp_source.html#l00039">DFNmain.cpp:39</a></div></div>
<div class="ttc" id="vector_functions_8h_html"><div class="ttname"><a href="vector_functions_8h.html">vectorFunctions.h</a></div></div>
<div class="ttc" id="structures_8h_html"><div class="ttname"><a href="structures_8h.html">structures.h</a></div></div>
<div class="ttc" id="struct_poly_html_a2cb519bcf0553215de907c8fc878a255"><div class="ttname"><a href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">Poly::vertices</a></div><div class="ttdeci">double * vertices</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00070">structures.h:70</a></div></div>
<div class="ttc" id="vector_functions_8h_html_abb1d4beb5939c7a5ddd4978c15fab7bb"><div class="ttname"><a href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a></div><div class="ttdeci">T dotProduct(const T *A, const T *B)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00058">vectorFunctions.h:58</a></div></div>
<div class="ttc" id="domain_8cpp_html_aed3d77c17f33d2024704b479d0885332"><div class="ttname"><a href="domain_8cpp.html#aed3d77c17f33d2024704b479d0885332">domainTruncation</a></div><div class="ttdeci">bool domainTruncation(Poly &amp;newPoly, double *domainSize)</div><div class="ttdef"><b>Definition:</b> <a href="domain_8cpp_source.html#l00019">domain.cpp:19</a></div></div>
<div class="ttc" id="domain_8cpp_html_a5663d165e5cc1ef6def5cebdc19bc573"><div class="ttname"><a href="domain_8cpp.html#a5663d165e5cc1ef6def5cebdc19bc573">printPoints</a></div><div class="ttdeci">void printPoints(std::vector&lt; double &gt; &amp;point)</div><div class="ttdef"><b>Definition:</b> <a href="domain_8cpp_source.html#l00279">domain.cpp:279</a></div></div>
<div class="ttc" id="domain_8h_html"><div class="ttname"><a href="domain_8h.html">domain.h</a></div></div>
<div class="ttc" id="input_8h_html_a5cd62663cb067d79183d8de4dd0224db"><div class="ttname"><a href="input_8h.html#a5cd62663cb067d79183d8de4dd0224db">domainSize</a></div><div class="ttdeci">double domainSize[3]</div><div class="ttdef"><b>Definition:</b> <a href="read_input_8cpp_source.html#l00018">readInput.cpp:18</a></div></div>
<div class="ttc" id="input_8h_html_a8ee9be1b5aa75abae556de3088cba6d9"><div class="ttname"><a href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a></div><div class="ttdeci">double h</div><div class="ttdef"><b>Definition:</b> <a href="read_input_8cpp_source.html#l00021">readInput.cpp:21</a></div></div>
<div class="ttc" id="struct_poly_html_ae110548a9a60aacab55ecce02d759d8d"><div class="ttname"><a href="struct_poly.html#ae110548a9a60aacab55ecce02d759d8d">Poly::faces</a></div><div class="ttdeci">bool faces[6]</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00084">structures.h:84</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="domain_8cpp.html">domain.cpp</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.12 </li>
  </ul>
</div>
</body>
</html>
