<!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: computationalGeometry.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('computational_geometry_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">computationalGeometry.cpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="computational_geometry_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;iomanip&gt;</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="preprocessor">#include &lt;algorithm&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="computational_geometry_8h.html">computationalGeometry.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="structures_8h.html">structures.h</a>&quot;</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div><div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="preprocessor">#include &lt;cmath&gt;</span></div><div class="line"><a name="l00007"></a><span class="lineno">    7</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="l00008"></a><span class="lineno">    8</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="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="math_functions_8h.html">mathFunctions.h</a>&quot;</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="generating_points_8h.html">generatingPoints.h</a>&quot;</span></div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include &lt;fstream&gt;</span></div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include &lt;random&gt;</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="testing_8h.html">testing.h</a>&quot;</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="cluster_groups_8h.html">clusterGroups.h</a>&quot;</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment">/*********************** 2D rotation matrix ***************************/</span></div><div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a0de7b2e0479ef51bf9a286b09f2b53e1">   24</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="computational_geometry_8cpp.html#a878eeb1b4990cde9d7d12a64f647af4d">applyRotation2D</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <span class="keywordtype">float</span> angle) {</div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;        </div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;    <span class="keywordtype">float</span> sinCalc = sin(angle); </div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;    <span class="keywordtype">float</span> cosCalc = cos(angle);</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="comment">// Rotates polygon on x-y plane counter-clockwise</span></div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>; i++) {</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;        <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;        <span class="keywordtype">double</span> x = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx];</div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;        <span class="keywordtype">double</span> y = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1];</div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;        newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx] = (x * cosCalc) + (y * sinCalc); <span class="comment">// x</span></div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;        newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] = (x * -sinCalc) + (y * cosCalc); <span class="comment">// y</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;        newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] = 0; <span class="comment">// z</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;}</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment">//**********************************************************************/</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">//************************  Translate  *********************************/</span></div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a3098cccf29c7a47d2eae661b0f545224">   47</a></span>&#160;<span class="comment"></span><span class="keywordtype">void</span> <a class="code" href="computational_geometry_8cpp.html#a3098cccf29c7a47d2eae661b0f545224">translate</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <span class="keywordtype">double</span> *translation) {</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;        newPoly.<a class="code" href="struct_poly.html#ac93df10849f4916e195a899d2ba55485">translation</a>[0] = translation[0];</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;        newPoly.<a class="code" href="struct_poly.html#ac93df10849f4916e195a899d2ba55485">translation</a>[1] = translation[1];</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        newPoly.<a class="code" href="struct_poly.html#ac93df10849f4916e195a899d2ba55485">translation</a>[2] = translation[2];</div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;</div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>; i++) {</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</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]   + translation[0];</div><div class="line"><a name="l00056"></a><span class="lineno">   56</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+1] + translation[1];</div><div class="line"><a name="l00057"></a><span class="lineno">   57</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+2] + translation[2];</div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    }</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;}</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;<span class="comment">//*********************************************************************/</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;<span class="comment">//******************** Build Rotation Ratrix **************************/</span></div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a8aaea6ef9d977f6d7d571d45ace1ad5d">   73</a></span>&#160;<span class="comment"></span><span class="keywordtype">double</span> *<a class="code" href="computational_geometry_8cpp.html#a8aaea6ef9d977f6d7d571d45ace1ad5d">rotationMatrix</a>(<span class="keywordtype">double</span> *normalA, <span class="keywordtype">double</span> *normalB) {</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="comment">//***************************************************</span></div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    <span class="comment">// Note: Normals must be normalized by this point!!!!!!</span></div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <span class="comment">// Since vectors are normalized, sin = magnitude(AxB) and cos = A dot B</span></div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    <span class="comment">//***************************************************</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    </div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    <span class="comment">// normalA is current normal</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    <span class="comment">// nNormalB is target normal</span></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;    <span class="comment">// Delete manually with delete[], created with new[]</span></div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordtype">double</span> *xProd = <a class="code" href="vector_functions_8h.html#a94303b1c8dd36d71e57fd0e4d5d26ae3">crossProduct</a>(normalA, normalB); </div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;    </div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    <span class="comment">// If not parallel            </span></div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    <span class="keywordflow">if</span> (!(std::abs(xProd[0]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[1]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[2]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>)) {</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <span class="comment">// sin = magnitude(AxB) and cos = A . B</span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <span class="keywordtype">double</span> sin = sqrt(xProd[0]*xProd[0] + xProd[1]*xProd[1] + xProd[2]*xProd[2]);</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordtype">double</span> cos = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(normalA, normalB);</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;        <span class="keywordtype">double</span> v[9] = {0, -xProd[2], xProd[1], xProd[2], 0, -xProd[0], -xProd[1], xProd[0], 0};</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;        <span class="keywordtype">double</span> scalar = (1.0f-cos)/(sin*sin);</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;        <span class="keywordtype">double</span> vSquared[9];</div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;        vSquared[0] = (v[0]*v[0] + v[1]*v[3] + v[2]*v[6])*scalar;</div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;        vSquared[1] = (v[0]*v[1] + v[1]*v[4] + v[2]*v[7])*scalar;</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;        vSquared[2] = (v[0]*v[2] + v[1]*v[5] + v[2]*v[8])*scalar;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        vSquared[3] = (v[3]*v[0] + v[4]*v[3] + v[5]*v[6])*scalar;</div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        vSquared[4] = (v[3]*v[1] + v[4]*v[4] + v[5]*v[7])*scalar;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        vSquared[5] = (v[3]*v[2] + v[4]*v[5] + v[5]*v[8])*scalar;</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;        vSquared[6] = (v[6]*v[0] + v[7]*v[3] + v[8]*v[6])*scalar;</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;        vSquared[7] = (v[6]*v[1] + v[7]*v[4] + v[8]*v[7])*scalar;</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        vSquared[8] = (v[6]*v[2] + v[7]*v[5] + v[8]*v[8])*scalar;</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        </div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;        <span class="keywordtype">double</span> *R = <span class="keyword">new</span> <span class="keywordtype">double</span>[9];</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        R[0] = 1 + v[0] + vSquared[0];</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;        R[1] = 0 + v[1] + vSquared[1];</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        R[2] = 0 + v[2] + vSquared[2];</div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        R[3] = 0 + v[3] + vSquared[3];</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;        R[4] = 1 + v[4] + vSquared[4];</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;        R[5] = 0 + v[5] + vSquared[5];</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;        R[6] = 0 + v[6] + vSquared[6];</div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;        R[7] = 0 + v[7] + vSquared[7];</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;        R[8] = 1 + v[8] + vSquared[8];</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;        </div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;        <span class="keyword">delete</span>[] xProd;</div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;        <span class="keywordflow">return</span> R; <span class="comment">// Make sure to delete R with delete[]    </span></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;    <span class="keywordflow">else</span> { <span class="comment">// normalA and normalB are parallel, return identity matrix</span></div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;        <span class="keywordtype">double</span> *R = <span class="keyword">new</span> <span class="keywordtype">double</span>[9];</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;        R[0] = 1;</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;        R[1] = 0;</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;        R[2] = 0;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;        R[3] = 0;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;        R[4] = 1;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;        R[5] = 0;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;        R[6] = 0;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;        R[7] = 0;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;        R[8] = 1;</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        </div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        <span class="keyword">delete</span>[] xProd;</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        <span class="keywordflow">return</span> R; <span class="comment">// Make sure to delete R with delete[]    </span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    }</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;}</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment">//*********************************************************************/</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;<span class="comment">/********** Applies a Rotation Matrix to poly vertices ****************/</span></div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;<span class="comment">//  RotMatrix = I + V + V^2((1-cos)/sin^2)) rotate to new normal       /</span></div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;<span class="comment">/**********************************************************************/</span>    </div><div class="line"><a name="l00147"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a0d5da6b9c8dc5c9193e7ea07d2ba466e">  147</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="computational_geometry_8cpp.html#af7f1ba8a57908229078780a2695e4e46">applyRotation3D</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <span class="keywordtype">double</span> *normalB) {</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    <span class="comment">// Normals should already be normalized by this point!!!</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;    <span class="comment">// NormalA: newPoly&#39;s current normal</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    <span class="comment">// NormalB: target normal</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;    <span class="comment">// Delete manually with delete[], created with new[]</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    <span class="keywordtype">double</span> *xProd = <a class="code" href="vector_functions_8h.html#a94303b1c8dd36d71e57fd0e4d5d26ae3">crossProduct</a>(newPoly.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>, normalB); </div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    </div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    <span class="comment">// If not parallel            </span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    <span class="keywordflow">if</span> (!(std::abs(xProd[0]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[1]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[2]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> )) {</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="comment">// NOTE: rotationMatrix() requires normals to be normalized                </span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        <span class="keywordtype">double</span> *R = <a class="code" href="computational_geometry_8cpp.html#a8aaea6ef9d977f6d7d571d45ace1ad5d">rotationMatrix</a>(newPoly.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>, normalB);</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        </div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="comment">// Apply rotation to all vertices</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>; i++) {</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;            <span class="keywordtype">double</span> vertices[3];</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            vertices[0] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   * R[0] </div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] * R[1] </div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] * R[2];</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            vertices[1] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   * R[3] </div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] * R[4] </div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] * R[5];</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;            vertices[2] = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   * R[6] </div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] * R[7] </div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                        + newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] * R[8];</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;        </div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   = vertices[0];</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;            newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] = vertices[1];</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;            newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] = vertices[2];                </div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        }</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;        <span class="keyword">delete</span>[] R;</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    } </div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="comment">// xProd was created dynamically in crossProduct(), need to delete it  </span></div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="keyword">delete</span>[] xProd;       </div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;}</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;<span class="comment">/* 3D Rotation Matrix for intersection, trip. points, and  polygpons **/</span></div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;<span class="comment">/*  RotMatrix = I + V + V^2((1-cos)/sin^2))                           */</span></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a06628fbaa79aad7eec7a74c5341e77bd">  207</a></span>&#160;<span class="keyword">struct </span><a class="code" href="struct_int_points.html">IntPoints</a> <a class="code" href="computational_geometry_8cpp.html#a06628fbaa79aad7eec7a74c5341e77bd">polyAndIntersection_RotationToXY</a>(struct <a class="code" href="struct_int_points.html">IntPoints</a> &amp;intersection, <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, std::vector&lt;Point&gt; &amp;triplePoints, std::vector&lt;Point&gt; &amp;tempTripPts) {</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    <span class="comment">// newPoly.normal = newPoly&#39;s current normal, should already be normalized</span></div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;    <span class="comment">// normalB = target normal</span></div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;    <span class="keywordtype">double</span> normalB[3] = { 0, 0, 1 };</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;    <a class="code" href="struct_int_points.html">IntPoints</a> tempIntpts;</div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;    <span class="comment">// Delete xProd manually, created with new[]</span></div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    <span class="keywordtype">double</span> *xProd = <a class="code" href="vector_functions_8h.html#a94303b1c8dd36d71e57fd0e4d5d26ae3">crossProduct</a>(newPoly.normal, normalB); </div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;        </div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;    <span class="comment">// If not parallel (zero vector)</span></div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;    <span class="keywordflow">if</span> (!(std::abs(xProd[0]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[1]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; std::abs(xProd[2]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> )) {</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;        <span class="comment">// rotationMatrix() requires normals to be normalized</span></div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        <span class="keywordtype">double</span> *R = <a class="code" href="computational_geometry_8cpp.html#a8aaea6ef9d977f6d7d571d45ace1ad5d">rotationMatrix</a>(newPoly.normal, normalB);    </div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;        </div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;        <span class="comment">// Because the normal&#39;s in the polygon structure don&#39;t change (we need them to </span></div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        <span class="comment">// write params.txt), the xProd check at the top of the function may not work. </span></div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <span class="comment">// Poly vertices may have already been rotated to XY plane but the normal </span></div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;        <span class="comment">// was unchanged. newPoly.XYPlane resolves this issue. It will tell us if </span></div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;        <span class="comment">// the polyon has already been rotated to xy plane</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;        <span class="comment">// Check if nodes are not already on x-y plane:</span></div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <span class="keywordflow">if</span> (newPoly.XYPlane != 1) { <span class="comment">// If not on x-y plane:</span></div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; newPoly.numberOfNodes; i++) {</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;                <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;                <span class="keywordtype">double</span> vertices[3];</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;                <span class="comment">// Apply rotation matrix R to each vertice</span></div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;                vertices[0] = newPoly.vertices[idx]   * R[0] </div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;                            + newPoly.vertices[idx+1] * R[1] </div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;                            + newPoly.vertices[idx+2] * R[2];</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;                vertices[1] = newPoly.vertices[idx]   * R[3] </div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;                            + newPoly.vertices[idx+1] * R[4] </div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;                            + newPoly.vertices[idx+2] * R[5];</div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;</div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;                vertices[2] = newPoly.vertices[idx]   * R[6] </div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;                            + newPoly.vertices[idx+1] * R[7] </div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;                            + newPoly.vertices[idx+2] * R[8];</div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;        </div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;                <span class="comment">// Save vertices back to poly struct, now on x-y plane</span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;                newPoly.vertices[idx]   = vertices[0];</div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;                newPoly.vertices[idx+1] = vertices[1];</div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                newPoly.vertices[idx+2] = vertices[2];    </div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;            }</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;        </div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;        <span class="comment">// Rotate intersection endpoints</span></div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> = intersection.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> * R[0] </div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> * R[1] </div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> * R[2];</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> = intersection.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> * R[3] </div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> * R[4] </div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> * R[5];</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;        tempIntpts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> = intersection.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> * R[6] </div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> * R[7] </div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> * R[8];</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;        tempIntpts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> = intersection.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> * R[0] </div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> * R[1] </div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> * R[2];</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;        tempIntpts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> = intersection.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> * R[3] </div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> * R[4] </div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> * R[5];</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;        tempIntpts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> = intersection.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> * R[6] </div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> * R[7] </div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;                      + intersection.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> * R[8];</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        </div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        <span class="comment">// Rotate any existing triple intersection pts to xy plane</span></div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        <a class="code" href="struct_point.html">Point</a> tmpPt;</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;intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>.size(); i++) {</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;            tmpPt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a> = triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].x*R[0] </div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].y*R[1]</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].z*R[2];</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;            tmpPt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a> = triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].x*R[3]</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].y*R[4]</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].z*R[5];</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;            tmpPt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a> = triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].x*R[6] </div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].y*R[7]</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;                    + triplePoints[intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i]].z*R[8];</div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;        </div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;            tempTripPts.push_back(tmpPt);</div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;        }</div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;    }</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;    <span class="keywordflow">else</span> { <span class="comment">// Already on xy plane (normal = {0,0,1}), no rotation required</span></div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;        <span class="comment">// Copy triple points to tempIntpts </span></div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>.size(); i++) {</div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;            <span class="keywordtype">int</span> idx = intersection.<a class="code" href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">triplePointsIdx</a>[i];</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;            tempTripPts.push_back(triplePoints[idx]);</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;        }</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> = intersection.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>;</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> = intersection.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>;</div><div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> = intersection.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>;</div><div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> = intersection.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>;</div><div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> = intersection.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>;</div><div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;        tempIntpts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> = intersection.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>;</div><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;    } </div><div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;</div><div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;    newPoly.XYPlane = 1; <span class="comment">// Mark poly being rotated to xy plane</span></div><div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;    <span class="keyword">delete</span>[] xProd; <span class="comment">// xProd was created dynamically in crossProduct(), delete it        </span></div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;    <span class="keywordflow">return</span> tempIntpts;</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;}</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;</div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;<span class="comment">/********************** Create Bounding box ***************************/</span></div><div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#ace23b489a120bc6d6407f7e08e1e009d">  322</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="computational_geometry_8cpp.html#ace23b489a120bc6d6407f7e08e1e009d">createBoundingBox</a>(<span class="keyword">struct</span> <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly) {</div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;    <span class="comment">// Initialize mins and maxs</span></div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="keywordtype">double</span> maxX, minX, maxY, minY, maxZ, minZ;</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;    maxX = minX = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[0]; <span class="comment">// x1</span></div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;    maxY = minY = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[1]; <span class="comment">// y1</span></div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;    maxZ = minZ = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[2]; <span class="comment">// z1</span></div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;    </div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; newPoly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>; i++) {</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;    <span class="keywordtype">int</span> idx = i*3;</div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <span class="comment">// idx = x</span></div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        <span class="keywordflow">if</span> (maxX &lt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]) {  </div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;            maxX = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx];    </div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;        }                                                                       </div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (minX &gt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]) {</div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            minX = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx];</div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;        }</div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        <span class="comment">// idx+1 = y</span></div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        <span class="keywordflow">if</span> (maxY &lt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1]) {</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;            maxY = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1];</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;        }    </div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (minY &gt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1]) {</div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;            minY = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1];</div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;        }</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;        <span class="comment">// idx+2 = z</span></div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        <span class="keywordflow">if</span> (maxZ &lt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2]) {</div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;            maxZ = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2];</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;        }    </div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (minZ &gt; newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2]) {</div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;            minZ = newPoly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2];</div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;        }</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;    }</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[0] = minX;</div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[1] = maxX;</div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[2] = minY;</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[3] = maxY;</div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[4] = minZ;</div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;    newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[5] = maxZ;    </div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;}</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;</div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a68c9aa4c8a1d635c5a662c94722bd19f">  365</a></span>&#160;<span class="keywordtype">void</span> <a class="code" href="computational_geometry_8cpp.html#a68c9aa4c8a1d635c5a662c94722bd19f">printBoundingBox</a>(<span class="keyword">struct</span> <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly) {</div><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;    std::cout&lt;&lt;<span class="stringliteral">&quot;\nBounding Box:\n&quot;</span>;</div><div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;    std::cout&lt;&lt;<span class="stringliteral">&quot;MinX = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[0]&lt;&lt;<span class="stringliteral">&quot;    MaxX = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[1]&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;    std::cout&lt;&lt;<span class="stringliteral">&quot;MinY = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[2]&lt;&lt;<span class="stringliteral">&quot;    MaxY = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[3]&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;    std::cout&lt;&lt;<span class="stringliteral">&quot;MinZ = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[4]&lt;&lt;<span class="stringliteral">&quot;    MaxZ = &quot;</span>&lt;&lt;newPoly.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[5]&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div><div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;}</div><div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;</div><div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;</div><div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;<span class="comment">/*********************** Check Bounding Box ***************************/</span></div><div class="line"><a name="l00379"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a8f29f7390c5415ae171ee96d38ff858f">  379</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#a4016983189eb7ed8e227b49477018d8a">checkBoundingBox</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;poly1, <a class="code" href="struct_poly.html">Poly</a> &amp;poly2) {</div><div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div><div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[1] &lt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[0]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00382"></a><span class="lineno">  382</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[0] &gt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[1]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[3] &lt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[2]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[2] &gt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[3]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[5] &lt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[4]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;    <span class="keywordflow">if</span> (poly1.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[4] &gt; poly2.<a class="code" href="struct_poly.html#aa650b6516110395f670252cb55f896c0">boundingBox</a>[5]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;}</div><div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;</div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;<span class="comment">/****************** Find Intersections ********************************/</span></div><div class="line"><a name="l00399"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a415bf8d3cbc3ccbdf9c8f7bbff35bc96">  399</a></span>&#160;<span class="keyword">struct </span><a class="code" href="struct_int_points.html">IntPoints</a> <a class="code" href="computational_geometry_8cpp.html#acc7b1a87dc0b49ffcb9898dae4cc4e96">findIntersections</a>(short &amp;flag, <a class="code" href="struct_poly.html">Poly</a> &amp;poly1, <a class="code" href="struct_poly.html">Poly</a> &amp;poly2) {</div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;<span class="comment">/* FLAGS: 0 = no intersection</span></div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;<span class="comment">   NOTE: The only flag which is currently used is &#39;0&#39;</span></div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;<span class="comment">         1 = intersection is completely inside poly 1 (new fracture)/poly)                                 </span></div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;<span class="comment">         2 = intersection is completely inside poly 2 (already accepted poly)</span></div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;<span class="comment">         3 = intsersection on both polys edges</span></div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;<span class="comment">         current implimentation: poly1 is the new fracture being tested            </span></div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;<span class="comment">             poly2 is a previously accepted fracture newPoly is being tested against</span></div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;<span class="comment">*/</span></div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;</div><div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;<span class="comment">// This code is mostly converted directly from the mathematica version. </span></div><div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;<span class="comment">// Re-write may be worth doing for increased performance and code clarity </span></div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;</div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;    flag = 0;</div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;    <a class="code" href="struct_int_points.html">IntPoints</a> intPts; <span class="comment">// Final intersection points                             </span></div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;                                 </div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;    <span class="keywordtype">int</span> count;</div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;    <a class="code" href="struct_poly.html">Poly</a> *F1; <span class="comment">// Fracture 1 </span></div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;    <a class="code" href="struct_poly.html">Poly</a> *F2; <span class="comment">// Fracture 2 </span></div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;    <span class="keywordtype">double</span> inters2[6]; <span class="comment">// Temporary intersection points of F2 and P1</span></div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;    <span class="keywordtype">double</span> inters[12]; <span class="comment">// Stores 4 possible intersection points {x,y,z} * 3</span></div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;    <span class="keywordtype">double</span> temp[3];      </div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;      </div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;    <span class="comment">// Get intersecction points</span></div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> jj = 0; jj&lt;2; jj++) {</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;        count = 0; <span class="comment">// Intersection point number</span></div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;        <span class="keywordflow">if</span> (jj == 0 ) {</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;            F1 = &amp;poly1; </div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;            F2 = &amp;poly2; </div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        }</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;        <span class="keywordflow">else</span> {</div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;            F1 = &amp;poly2;</div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;            F2 = &amp;poly1;        </div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        }</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;        <span class="keywordtype">int</span> nVertices2 = F2-&gt;<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>;</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;        <span class="keywordtype">int</span> index = (nVertices2-1) * 3; <span class="comment">// Index to last vertice</span></div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;        <span class="keywordtype">double</span> vertex1[3] = { F1-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[0], F1-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[1], F1-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[2] };</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;        </div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;        temp[0] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index]   - vertex1[0]; <span class="comment">// x1 -x2</span></div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;        temp[1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1] - vertex1[1]; <span class="comment">// y1 - y2</span></div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;        temp[2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2] - vertex1[2]; <span class="comment">// z1 - z2</span></div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;    </div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;        <span class="keywordtype">double</span> prevdist = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(temp, F1-&gt;<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>);</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;        <span class="keywordtype">double</span> currdist;</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;        </div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; nVertices2; i++) { <span class="comment">// i: current point</span></div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;            <span class="keywordtype">int</span> idx = i * 3;</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;            <span class="comment">/* vector of vertex1 to a vertex on F2 dot normal vector of F1</span></div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;<span class="comment">               it&#39;s absolute value is the distance */</span></div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;            temp[0] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   - vertex1[0];</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;            temp[1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] - vertex1[1];</div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;            temp[2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] - vertex1[2];</div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;            currdist = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(temp, F1-&gt;<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>);</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;            </div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;            <span class="keywordflow">if</span> (std::abs(prevdist) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;                <span class="keywordflow">if</span> (i == 0) {</div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;                    <span class="comment">// Previous point is intersection point</span></div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;                    inters2[0] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index];   <span class="comment">// x</span></div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;                    inters2[1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1]; <span class="comment">// y</span></div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;                    inters2[2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2]; <span class="comment">// z</span></div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;                    count++;</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;                }</div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;                <span class="keywordflow">else</span> {</div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;                    <span class="keywordtype">int</span> idx = (i-1)*3;</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;                    <span class="keywordtype">int</span> countidx = count*3;</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;                    inters2[countidx]   = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx];   <span class="comment">// x</span></div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;                    inters2[countidx+1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1]; <span class="comment">// y</span></div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;                    inters2[countidx+2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2]; <span class="comment">// z</span></div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;                    count++;</div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;                } </div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;            }</div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;            <span class="keywordflow">else</span> {    </div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;                <span class="keywordtype">double</span> currTimesPrev = currdist * prevdist;</div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;                <span class="keywordflow">if</span> (std::abs(currTimesPrev) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;                    currTimesPrev = 0; </div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;                }</div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;                        </div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;                <span class="keywordflow">if</span> (currTimesPrev &lt; 0) { </div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;                <span class="comment">// If consecutive vertices of F2 are at opposide sides of P1,  </span></div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;                <span class="comment">// computes intersection point of F2 and P1</span></div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;                                        </div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;                    <span class="keywordtype">double</span> c = std::abs(prevdist)/(std::abs(currdist)+std::abs(prevdist));</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;                    <span class="keywordtype">int</span> countidx = count * 3;</div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;                    <span class="keywordflow">if</span>(i == 0) { </div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;                        inters2[countidx]   = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index]   </div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[0]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index]) * c;</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;                        inters2[countidx+1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1] </div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[1]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+1]) * c; </div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;                        inters2[countidx+2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2] </div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[2]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[index+2]) * c; </div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;                        count++;</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                    }</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;                    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;                        <span class="keywordtype">int</span> idx = (i-1) * 3;</div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;                        <span class="keywordtype">int</span> x = i*3;</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;                        inters2[countidx]   = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]   </div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[x]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx]) * c; </div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;                        inters2[countidx+1] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1] </div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[x+1]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1]) * c; </div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;                        inters2[countidx+2] = F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2] </div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;                                            + (F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[x+2]-F2-&gt;<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2]) * c;</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;                        count++;</div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;                    }    </div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;                }</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;            }</div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;            prevdist = currdist; </div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;            <span class="keywordflow">if</span> (count == 2) {</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;                <span class="keywordflow">break</span>; }    </div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;                    </div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;        } <span class="comment">// End vertice loop </span></div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;    </div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="keywordflow">if</span> (count == 1) { </div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;        <span class="comment">// If only one intersection point, happens only when a vertex of F2 is on P1</span></div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;            count = 2;</div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;            inters2[3] = inters2[0];</div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;            inters2[4] = inters2[1];</div><div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;            inters2[5] = inters2[2];</div><div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        }</div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;</div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k&lt;6; k++) { </div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;            <span class="keywordflow">if</span> (std::abs(inters2[k]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;                inters2[k] = 0; }</div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;        }        </div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        </div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;        <span class="comment">// copy to inters array</span></div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;        <span class="keywordtype">int</span> jindx = 6*jj;</div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        inters[jindx]   = inters2[0]; </div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        inters[jindx+1] = inters2[1]; </div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;        inters[jindx+2] = inters2[2]; </div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;        inters[jindx+3] = inters2[3]; </div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;        inters[jindx+4] = inters2[4]; </div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        inters[jindx+5] = inters2[5];</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;        </div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        <span class="keywordflow">if</span> (count == 0) {</div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;            <span class="keywordflow">break</span>; </div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;        } <span class="comment">// No intersection</span></div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;    } <span class="comment">// End loop for jj, loop for getting intersections for fracture i and newPoly</span></div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;        </div><div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;    <span class="keywordflow">if</span> (count == 0) {</div><div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;        flag = 0;</div><div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;    }</div><div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;    <span class="keywordflow">else</span> { <span class="comment">// Intersection points exist</span></div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;        <span class="keywordflow">if</span> (count &gt;2) { std::cout&lt;&lt;<span class="stringliteral">&quot;Error in findIntersections()\n&quot;</span>; }</div><div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;        </div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;        <span class="comment">// Use delete[] on &#39;stdev&#39;, created dynamically</span></div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        <span class="keywordtype">double</span> *stdev = <a class="code" href="math_functions_8cpp.html#a144421162e6b2cc91b275cf0c41488da">sumDevAry3</a>(inters); </div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;        </div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;        <span class="keywordtype">int</span> o = <a class="code" href="math_functions_8cpp.html#a31921fcb145e36a988b2fca62c737815">maxElmtIdx</a>(stdev,3);</div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;        </div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;        <span class="keywordtype">double</span> tempAry[4] = {inters[o], inters[o+3], inters[o+6], inters[o+9]};</div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;</div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;        <span class="keywordtype">int</span> *s = <a class="code" href="math_functions_8cpp.html#a50249713d75d2446b44572f47cc0c560">sortedIndex</a>(tempAry,4); </div><div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;                    </div><div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;        <span class="keywordflow">if</span> (!(s[0] + s[1] == 1 || s[0] + s[1] == 5)) {                                                              </div><div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;        <span class="comment">// If the smallest two points are not on the bdy of the same poly, </span></div><div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;        <span class="comment">// the polygons intersect. middle two points form intersetion</span></div><div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;</div><div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;        <span class="keywordtype">int</span> idx1 = s[1]*3;</div><div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;        <span class="keywordtype">int</span> idx2 = s[2]*3;    </div><div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;        </div><div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;        intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> = inters[idx1];   <span class="comment">// x1</span></div><div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;        intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> = inters[idx1+1]; <span class="comment">// y1</span></div><div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;        intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> = inters[idx1+2]; <span class="comment">// z1</span></div><div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;        intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> = inters[idx2];   <span class="comment">// x2</span></div><div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;        intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> = inters[idx2+1]; <span class="comment">// y2</span></div><div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;        intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> = inters[idx2+2]; <span class="comment">// z2</span></div><div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;</div><div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;            <span class="comment">// Assign flag (definitions at top of funciton)</span></div><div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;            <span class="keywordflow">if</span> (s[1] + s[2] == 1) {</div><div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;                flag = 1;}    <span class="comment">// Intersection inside poly1</span></div><div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s[1] + s[2] == 5 ) {</div><div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;                flag = 2;}    <span class="comment">// Intersection inside poly2</span></div><div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;            <span class="keywordflow">else</span>{ </div><div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;                flag = 3;}    <span class="comment">// Intersection on edges</span></div><div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;        } </div><div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;        <span class="keywordflow">else</span> { <span class="comment">// Intersection doesn&#39;t exist</span></div><div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;            flag = 0; <span class="comment">// No intersection </span></div><div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        }</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;</div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;        <span class="keyword">delete</span>[] s;   </div><div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;        <span class="keyword">delete</span>[] stdev;</div><div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;        </div><div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;    } <span class="comment">// End  intersection points exist</span></div><div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;    <span class="keywordflow">return</span> intPts;      </div><div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;} </div><div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;</div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;</div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;<span class="comment">/*************************************************************************************/</span></div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;<span class="comment">/*************************************************************************************/</span></div><div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;<span class="comment">/************************************ FRAM *******************************************/</span></div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;<span class="comment">/******************** Feature Rejection Algorithm for Meshing ************************/</span></div><div class="line"><a name="l00607"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a7ada98067054623a6bcc19ab19403682">  607</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="computational_geometry_8cpp.html#a7770747ef4153bfb4ae5d53dce0d5876">FRAM</a>(<a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> count, std::vector&lt;IntPoints&gt; &amp;intPtsList, <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <a class="code" href="struct_poly.html">Poly</a> &amp;poly2, <a class="code" href="struct_stats.html">Stats</a> &amp;pstats, std::vector&lt;TriplePtTempData&gt; &amp;tempData, std::vector&lt;Point&gt; &amp;triplePoints, std::vector&lt;IntPoints&gt; &amp;tempIntPts) {</div><div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;</div><div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;    <span class="keywordflow">if</span> (<a class="code" href="input_8h.html#a0071fcf088e13e14d3cfa0c15e33e363">disableFram</a> == <span class="keyword">false</span>) {</div><div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;        <span class="comment">/******* Check for intersection of length less than h *******/</span></div><div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>-intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>-intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>-intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>) &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;            <span class="comment">//std::cout&lt;&lt;&quot;\nrejectCode = -2: Intersection of length &lt;= h.\n&quot;;</span></div><div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#ab935b00ed9bf36d47d435a3f4fbd328d">shortIntersection</a>++;    </div><div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;            <span class="keywordflow">return</span> -2;</div><div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;        }</div><div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;</div><div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;         <span class="comment">/******************* distance to edges *****************/</span> </div><div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;        <span class="comment">// Reject if intersection shirnks &lt; &#39;shrinkLimit&#39;</span></div><div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;        <span class="keywordtype">double</span> shrinkLimit = 0.9 * <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> - intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> - intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> - intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>);</div><div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#adf34efb0050985566dfb41f51967680f">checkCloseEdge</a>(newPoly, intPts, shrinkLimit, pstats)) {</div><div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;            <span class="comment">// std::cout&lt;&lt;&quot;\nrejectCode = -6: Fracture too close to another fracture&#39;s edge.\n&quot;;</span></div><div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#adbb08b81bcca27734f30fc8314a48719">closeToEdge</a>++;</div><div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;            <span class="keywordflow">return</span> -6;</div><div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;        }</div><div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;</div><div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#adf34efb0050985566dfb41f51967680f">checkCloseEdge</a>(poly2, intPts, shrinkLimit, pstats)) {</div><div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;            <span class="comment">// std::cout&lt;&lt;&quot;\nrejectCode = -6: Fracture too close to another fracture&#39;s edge.\n&quot;;</span></div><div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#adbb08b81bcca27734f30fc8314a48719">closeToEdge</a>++;</div><div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;            <span class="keywordflow">return</span> -6;</div><div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;        }</div><div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;        <span class="comment">/*************** Triple Intersection Checks *************/</span></div><div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;        <span class="comment">// NOTE: for debugging, there are several rejection codes for triple intersections</span></div><div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;        <span class="comment">// -14 &lt;= rejCode &lt;= -10 are for triple intersection rejections</span></div><div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;</div><div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;        <span class="keywordtype">int</span> rejCode = <a class="code" href="computational_geometry_8cpp.html#a237899188f8ca6cf74a2da890cd13868">checkForTripleIntersections</a>(intPts, count, intPtsList, newPoly, poly2, tempData, triplePoints);</div><div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;        <span class="keywordflow">if</span> (rejCode != 0 ) {</div><div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#a71e3bcee9eb7d5eb99f60ec8832a8754">triple</a>++;</div><div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;            <span class="keywordflow">return</span> rejCode;</div><div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;        }</div><div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;</div><div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;        <span class="comment">/******* Intersection to Intersection Distance Checks ********/</span></div><div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;        <span class="comment">// Check distance from new intersection to other intersections on </span></div><div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;        <span class="comment">// poly2 (fracture newPoly is intersecting with)</span></div><div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;</div><div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#ac1228db3b0fb85b1a5233b1fb78edd4a">checkDistToOldIntersections</a>(intPtsList, intPts, poly2, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>)) {</div><div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#a8937dddd46dbdb1731e980500c02e1f3">interCloseToInter</a>++;</div><div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;            <span class="keywordflow">return</span> -5;</div><div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;        }</div><div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;</div><div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;        <span class="comment">// Check distance from new intersection to intersections already</span></div><div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;        <span class="comment">// existing on newPoly</span></div><div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;        <span class="comment">// Also checks for undetected triple points</span></div><div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#abdfd17162db7fd7ad2e4719255fa915f">checkDistToNewIntersections</a>(tempIntPts, intPts, tempData, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>)) {</div><div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#a8937dddd46dbdb1731e980500c02e1f3">interCloseToInter</a>++;</div><div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;            <span class="keywordflow">return</span> -5;</div><div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;        }</div><div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;</div><div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;        <span class="comment">// Check if polys intersect on same plane</span></div><div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;        <span class="keywordflow">if</span> (std::abs(newPoly.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[0]-poly2.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[0]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>  <span class="comment">// If the normals are the same</span></div><div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;            &amp;&amp; std::abs(newPoly.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[1]-poly2.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[1]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> </div><div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;            &amp;&amp; std::abs(newPoly.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[2]-poly2.<a class="code" href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">normal</a>[2]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> ) {</div><div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;            </div><div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;            <span class="keywordflow">return</span> -7; <span class="comment">// The intersection has already been found so we know that if the</span></div><div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;                      <span class="comment">// normals are the same they must be on the same plane</span></div><div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;        }    </div><div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;    }</div><div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;        <span class="keywordflow">return</span> 0; </div><div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;}</div><div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;</div><div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;</div><div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;<span class="comment">/****************************  FRAM CHECK  *****************************************/</span></div><div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;<span class="comment">/************ New intersction to Old Intersections Check ***************************/</span></div><div class="line"><a name="l00680"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#ac1228db3b0fb85b1a5233b1fb78edd4a">  680</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#ac1228db3b0fb85b1a5233b1fb78edd4a">checkDistToOldIntersections</a>(std::vector&lt;IntPoints&gt; &amp;intPtsList, <a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <a class="code" href="struct_poly.html">Poly</a> &amp;poly2, <span class="keywordtype">double</span> minDistance) {</div><div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;    <span class="keywordtype">double</span> intersection[6] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>, intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>};</div><div class="line"><a name="l00682"></a><span class="lineno">  682</span>&#160;    <span class="keywordtype">int</span> intSize = poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>.size();</div><div class="line"><a name="l00683"></a><span class="lineno">  683</span>&#160;    <span class="keywordtype">double</span> dist;</div><div class="line"><a name="l00684"></a><span class="lineno">  684</span>&#160;    <a class="code" href="struct_point.html">Point</a> pt;   </div><div class="line"><a name="l00685"></a><span class="lineno">  685</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; intSize; i ++) {    </div><div class="line"><a name="l00686"></a><span class="lineno">  686</span>&#160;        </div><div class="line"><a name="l00687"></a><span class="lineno">  687</span>&#160;        <span class="keywordtype">double</span> int2[6] = {intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].x1, intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].y1, intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].z1,</div><div class="line"><a name="l00688"></a><span class="lineno">  688</span>&#160;                       intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].x2, intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].y2, intPtsList[poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]].z2};</div><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;           </div><div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;        dist = <a class="code" href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a>(intersection, int2, pt); </div><div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;        <span class="keywordflow">if</span> (dist &lt; (minDistance-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) &amp;&amp; dist &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;            <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;        }</div><div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;    }</div><div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;}</div><div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;</div><div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;</div><div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;<span class="comment">/****************************  FRAM Check  *****************************************/</span></div><div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;<span class="comment">/************ New intersction to New Intersections Check ***************************/</span></div><div class="line"><a name="l00712"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a4c94ffa2818f164dbda3f1cb6f0fb9a8">  712</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#abdfd17162db7fd7ad2e4719255fa915f">checkDistToNewIntersections</a>(std::vector&lt;IntPoints&gt; &amp;tempIntPts, <a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, std::vector&lt;TriplePtTempData&gt; &amp;tempTriPts, <span class="keywordtype">double</span> minDistance) {</div><div class="line"><a name="l00713"></a><span class="lineno">  713</span>&#160;</div><div class="line"><a name="l00714"></a><span class="lineno">  714</span>&#160;    <span class="keywordtype">int</span> intSize = tempIntPts.size();</div><div class="line"><a name="l00715"></a><span class="lineno">  715</span>&#160;    <span class="keywordtype">double</span> intersection[6] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>, intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>};</div><div class="line"><a name="l00716"></a><span class="lineno">  716</span>&#160;    <a class="code" href="struct_point.html">Point</a> pt; <span class="comment">// Pt of intersection if lines intersect</span></div><div class="line"><a name="l00717"></a><span class="lineno">  717</span>&#160;</div><div class="line"><a name="l00718"></a><span class="lineno">  718</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; intSize; i ++) {    </div><div class="line"><a name="l00719"></a><span class="lineno">  719</span>&#160;        </div><div class="line"><a name="l00720"></a><span class="lineno">  720</span>&#160;        <span class="keywordtype">double</span> int2[6] = {tempIntPts[i].x1, tempIntPts[i].y1, tempIntPts[i].z1,</div><div class="line"><a name="l00721"></a><span class="lineno">  721</span>&#160;                          tempIntPts[i].x2, tempIntPts[i].y2, tempIntPts[i].z2};</div><div class="line"><a name="l00722"></a><span class="lineno">  722</span>&#160;           </div><div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        <span class="keywordtype">double</span> dist = <a class="code" href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a>(intersection, int2, pt);</div><div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;        </div><div class="line"><a name="l00725"></a><span class="lineno">  725</span>&#160;        <span class="keywordflow">if</span> (dist &lt; minDistance &amp;&amp; dist &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l00726"></a><span class="lineno">  726</span>&#160;            <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00727"></a><span class="lineno">  727</span>&#160;        }</div><div class="line"><a name="l00728"></a><span class="lineno">  728</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (dist &lt; eps) { </div><div class="line"><a name="l00729"></a><span class="lineno">  729</span>&#160;            <span class="comment">// Make sure there is a triple intersection point</span></div><div class="line"><a name="l00730"></a><span class="lineno">  730</span>&#160;            <span class="comment">// before accepting</span></div><div class="line"><a name="l00731"></a><span class="lineno">  731</span>&#160;            <span class="keywordtype">bool</span> reject = <span class="keyword">true</span>;</div><div class="line"><a name="l00732"></a><span class="lineno">  732</span>&#160;            <span class="keywordtype">int</span> size = tempTriPts.size();</div><div class="line"><a name="l00733"></a><span class="lineno">  733</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {    </div><div class="line"><a name="l00734"></a><span class="lineno">  734</span>&#160;                <span class="comment">// If the triple point is found, continue with checks, else reject</span></div><div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;                <span class="keywordflow">if</span> (std:: abs(pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a> - tempTriPts[i].triplePoint.x) &lt; eps </div><div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;                &amp;&amp; std::abs(pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a> - tempTriPts[i].triplePoint.y) &lt; eps </div><div class="line"><a name="l00737"></a><span class="lineno">  737</span>&#160;                &amp;&amp; std::abs(pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a> - tempTriPts[i].triplePoint.z) &lt; eps) {</div><div class="line"><a name="l00738"></a><span class="lineno">  738</span>&#160;                    reject = <span class="keyword">false</span>;</div><div class="line"><a name="l00739"></a><span class="lineno">  739</span>&#160;                    <span class="keywordflow">break</span>;</div><div class="line"><a name="l00740"></a><span class="lineno">  740</span>&#160;                }</div><div class="line"><a name="l00741"></a><span class="lineno">  741</span>&#160;            }</div><div class="line"><a name="l00742"></a><span class="lineno">  742</span>&#160;            <span class="keywordflow">if</span> (reject == <span class="keyword">true</span>) {</div><div class="line"><a name="l00743"></a><span class="lineno">  743</span>&#160;                <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00744"></a><span class="lineno">  744</span>&#160;            }</div><div class="line"><a name="l00745"></a><span class="lineno">  745</span>&#160;        }</div><div class="line"><a name="l00746"></a><span class="lineno">  746</span>&#160;    }</div><div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;}</div><div class="line"><a name="l00749"></a><span class="lineno">  749</span>&#160;</div><div class="line"><a name="l00750"></a><span class="lineno">  750</span>&#160;<span class="comment">/**********************************************************************/</span></div><div class="line"><a name="l00751"></a><span class="lineno">  751</span>&#160;<span class="comment">/************************* Shrink Intersection ************************/</span></div><div class="line"><a name="l00770"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a69f93a65c39c49d1b705fad32f790e98">  770</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#a69f93a65c39c49d1b705fad32f790e98">shrinkIntersection</a>(<a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <span class="keywordtype">double</span> *edge, <span class="keywordtype">double</span> shrinkLimit, <span class="keywordtype">double</span> firstNodeMinDist, <span class="keywordtype">double</span> minDist) {</div><div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;</div><div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;    <span class="keywordtype">double</span> vect[3] = {(intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>-intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>), (intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>-intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>), (intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>-intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>)};</div><div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;    <span class="keywordtype">double</span> dist = <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(vect[0], vect[1], vect[2]);</div><div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;</div><div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;    <span class="comment">// n is number of discrete points on intersection</span></div><div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;    <span class="keywordtype">int</span> n = std::ceil(2 * dist / <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>);</div><div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;    <span class="keywordtype">double</span> stepSize = 1 / (double)n;</div><div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;</div><div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;    <span class="keywordtype">double</span> pt[3] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>};</div><div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;</div><div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;    <span class="comment">// Start step at first descrete point</span></div><div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;    <span class="keywordtype">double</span> step;</div><div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;</div><div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;    <span class="comment">// Check both sides of intersection against edge</span></div><div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div><div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;        <span class="keywordtype">int</span> nodeCount = 0;</div><div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;        </div><div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;        <span class="keywordflow">if</span> (i == 0) { </div><div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;            step = 0;</div><div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;        }</div><div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <span class="keywordflow">else</span> { </div><div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;            step = 1;        </div><div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;        }</div><div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;</div><div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        <a class="code" href="struct_point.html">Point</a> point = <a class="code" href="generating_points_8cpp.html#a1765372f6dbad65b4d7cac36d830bdfe">lineFunction3D</a>(vect, pt, step);</div><div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;        <span class="keywordtype">double</span> firstPtDistToEdge = <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(point, edge);</div><div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;</div><div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;        <span class="keywordtype">bool</span> firstPt = <span class="keyword">true</span>; </div><div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;        <span class="keywordflow">while</span> (nodeCount &lt;= n) {</div><div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;            nodeCount++;</div><div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;</div><div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;            <span class="keywordflow">if</span> (i == 0) {</div><div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;                step += stepSize;</div><div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;            }</div><div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;            <span class="keywordflow">else</span> {</div><div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;                step -= stepSize;</div><div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;            }</div><div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;            </div><div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;            <a class="code" href="struct_point.html">Point</a> ptOnIntersection = <a class="code" href="generating_points_8cpp.html#a1765372f6dbad65b4d7cac36d830bdfe">lineFunction3D</a>(vect, pt, step);</div><div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;            </div><div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;            <span class="keywordtype">double</span> dist = <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(ptOnIntersection, edge);</div><div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;            <span class="keywordflow">if</span> (firstPt == <span class="keyword">true</span> &amp;&amp; (dist &gt; firstNodeMinDist)) { <span class="comment">// || (stepSize == 1 &amp;&amp; dist &lt; eps)))  {</span></div><div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;               <span class="keywordflow">if</span> (firstPtDistToEdge &lt; eps || firstPtDistToEdge &gt;= minDist) {</div><div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;                    <span class="comment">// Leave intersection end point un-modified</span></div><div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;                    <span class="keywordflow">break</span>;</div><div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;                }</div><div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;            }</div><div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;            </div><div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;            firstPt = <span class="keyword">false</span>;      </div><div class="line"><a name="l00820"></a><span class="lineno">  820</span>&#160; </div><div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;            <span class="keywordflow">if</span> (dist &gt; minDist) {</div><div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;                <span class="keywordflow">if</span> (i == 0) {</div><div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> = ptOnIntersection.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>;</div><div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> = ptOnIntersection.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>;</div><div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> = ptOnIntersection.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>;</div><div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;                }</div><div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;                <span class="keywordflow">else</span> {  </div><div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> = ptOnIntersection.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>;</div><div class="line"><a name="l00829"></a><span class="lineno">  829</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> = ptOnIntersection.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>;</div><div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;                    intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> = ptOnIntersection.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>;</div><div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;</div><div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;                }</div><div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;                intPts.<a class="code" href="struct_int_points.html#a5a3f21b54443313c41a69a05c043cefd">intersectionShortened</a> = <span class="keyword">true</span>;</div><div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;            }</div><div class="line"><a name="l00836"></a><span class="lineno">  836</span>&#160;            <span class="keywordflow">if</span> (nodeCount &gt;= n) { <span class="comment">// All nodes are bad, reject</span></div><div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;                <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;            }</div><div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        }</div><div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;    }</div><div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;    </div><div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;    <span class="comment">// If intersection length shrank to less than shrinkLimit, reject</span></div><div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;    <span class="keywordflow">if</span> (<a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>-intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>-intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>-intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>) &lt; shrinkLimit) {</div><div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;        <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;    }</div><div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;</div><div class="line"><a name="l00847"></a><span class="lineno">  847</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;}</div><div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;</div><div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;</div><div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;<span class="comment">/****************************************************************************************************/</span></div><div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;<span class="comment">/************************************** INTERSECTION CHECKING ***************************************/</span></div><div class="line"><a name="l00870"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#aff243280740a51cada5c0dd94021fb66">  870</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="computational_geometry_8cpp.html#a38a8c322dba7d8518a4c3206cd55a5f6">intersectionChecking</a>(<span class="keyword">struct</span> <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, std::vector&lt;Poly&gt; &amp;acceptedPoly, std::vector&lt;IntPoints&gt; &amp;intPtsList, <span class="keyword">struct</span> <a class="code" href="struct_stats.html">Stats</a> &amp;pstats, std::vector&lt;Point&gt; &amp;triplePoints) {</div><div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;</div><div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;    <span class="comment">// List of fractures which new fracture intersected.       </span></div><div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;    <span class="comment">// Used to update fractures intersections and </span></div><div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;    <span class="comment">// intersection count if newPoly is accepted</span></div><div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;    std::vector&lt;unsigned int&gt; tempIntersectList; </div><div class="line"><a name="l00876"></a><span class="lineno">  876</span>&#160;    std::vector&lt;IntPoints&gt; tempIntPts;</div><div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;    std::vector&lt;IntPoints&gt; tempOriginalIntersection;</div><div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;    <span class="comment">// Index to newPoly&#39;s position if accepted</span></div><div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;    <span class="keywordtype">int</span> newPolyIndex = acceptedPoly.size(); </div><div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;    <span class="comment">// Index to intpts if newPoly intersections accepted</span></div><div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;    <span class="keywordtype">int</span> intPtsIndex = intPtsList.size(); </div><div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;    std::vector&lt;unsigned int&gt; encounteredGroups;</div><div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;    <span class="comment">// Counts number of accepted intersections on newPoly. </span></div><div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> count = 0; </div><div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;    std::vector&lt;TriplePtTempData&gt; tempData;</div><div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;</div><div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;</div><div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> size = acceptedPoly.size();</div><div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ii = 0; ii &lt; size; ii++) {</div><div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;        <span class="keywordtype">short</span> flag; </div><div class="line"><a name="l00891"></a><span class="lineno">  891</span>&#160;</div><div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        <span class="comment">// NOTE: findIntersections() searches bounding boxes</span></div><div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;        <span class="comment">// Bounding box search</span></div><div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#a4016983189eb7ed8e227b49477018d8a">checkBoundingBox</a>(newPoly, acceptedPoly[ii])) {</div><div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;            <a class="code" href="struct_int_points.html">IntPoints</a> intersection = <a class="code" href="computational_geometry_8cpp.html#acc7b1a87dc0b49ffcb9898dae4cc4e96">findIntersections</a>(flag, newPoly, acceptedPoly[ii]); </div><div class="line"><a name="l00896"></a><span class="lineno">  896</span>&#160;</div><div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;            <span class="keywordflow">if</span> (flag != 0) { <span class="comment">// If flag != 0, intersection exists</span></div><div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;                <span class="comment">// Holds origintal intersection, used to update </span></div><div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;                <span class="comment">// stats on how much intersections were shortened</span></div><div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;                tempOriginalIntersection.push_back(intersection); </div><div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;</div><div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;                <span class="comment">// FRAM returns 0 if no intersection problems. </span></div><div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;                <span class="comment">// &#39;count&#39; is number of already accepted intersections on new poly</span></div><div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;</div><div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;                <span class="keywordtype">int</span> rejectCode = <a class="code" href="computational_geometry_8cpp.html#a7770747ef4153bfb4ae5d53dce0d5876">FRAM</a>(intersection, count, intPtsList, newPoly, acceptedPoly[ii], pstats, tempData, triplePoints, tempIntPts);</div><div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;</div><div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;                <span class="comment">// If intersection is NOT rejected</span></div><div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;                <span class="keywordflow">if</span> (rejectCode == 0) { <span class="comment">// If FRAM returned 0, everything is OK</span></div><div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;                    </div><div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;                    <span class="comment">// Update group numbers, intersection indexes            </span></div><div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;                    intersection.<a class="code" href="struct_int_points.html#a7649f6977183bec28e82f383df5c3df9">fract1</a> = ii; <span class="comment">// ii is the intersecting fracture</span></div><div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;                    intersection.<a class="code" href="struct_int_points.html#a817f8fb171be24d7383ba0a404192f88">fract2</a> = newPolyIndex; <span class="comment">// newPolys ID/index in array of accpted polys, if accepted</span></div><div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;</div><div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;                    <span class="comment">// &#39;tempIntersectList&#39; keeps all fracture #&#39;s intersecting with newPoly</span></div><div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;                    tempIntersectList.push_back(ii); <span class="comment">// Save fracture index to update if newPoly accepted</span></div><div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;</div><div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;                    <span class="comment">// Save index to polys intersections (intPts) array    </span></div><div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;                    newPoly.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>.push_back(intPtsIndex + count);    </div><div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;                    </div><div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;                    count++; <span class="comment">// Increment counter of number of fractures intersecting with newPoly</span></div><div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;                    tempIntPts.push_back(intersection); <span class="comment">// Save intersection</span></div><div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;                        </div><div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;                    <span class="comment">// If newPoly has not been assigned to a group, </span></div><div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;                    <span class="comment">// assign the group of the other intersecting fracture</span></div><div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;                        <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#add8e39b7f48274757f46c80014aaeb6b">groupNum</a> == 0) { </div><div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;                            newPoly.<a class="code" href="struct_poly.html#add8e39b7f48274757f46c80014aaeb6b">groupNum</a> = acceptedPoly[ii].groupNum;</div><div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;                        }</div><div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#add8e39b7f48274757f46c80014aaeb6b">groupNum</a> != acceptedPoly[ii].groupNum) { <span class="comment">// Poly bridged two different groupsa</span></div><div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;                            encounteredGroups.push_back(acceptedPoly[ii].groupNum); </div><div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;                        }</div><div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;                    }</div><div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;                <span class="keywordflow">else</span> { <span class="comment">// &#39;newPoly&#39; rejected</span></div><div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;                    <span class="comment">// SAVE REJECTED POLYS HERE IF THIS FUNCTINALITY IS NEEDED  </span></div><div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;                    <span class="keywordflow">return</span> rejectCode; <span class="comment">// Break loop/function and return 1, poly is rejected</span></div><div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;                }</div><div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;            } </div><div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;        } </div><div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;    }  <span class="comment">// If it makes it here, no problematic intersections with new polygon. SAVE POLY AND UPDATE GROUP/CLUSTER INFO      </span></div><div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;</div><div class="line"><a name="l00940"></a><span class="lineno">  940</span>&#160;     </div><div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;    <span class="comment">// Done searching intersections. All FRAM tests have passed. Polygon is accetepd. </span></div><div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;</div><div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;  </div><div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;    <span class="comment">// After searching for intersections, if newPoly still has no intersection or group:</span></div><div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;    <span class="keywordflow">if</span> (newPoly.<a class="code" href="struct_poly.html#add8e39b7f48274757f46c80014aaeb6b">groupNum</a> == 0) { <span class="comment">// &#39;newPoly&#39; had no intersections. Assign it to its own/new group number</span></div><div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        <a class="code" href="cluster_groups_8cpp.html#a379930b3782e888c9ccdf5a8106b3434">assignGroup</a>(newPoly, pstats, newPolyIndex);</div><div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;    }</div><div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;        <span class="comment">// Intersections exist and were accepted, newPoly already has group number</span></div><div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;        <span class="comment">// Save temp. intersections to intPts (permanent array), </span></div><div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;        <span class="comment">// Update all intersected polygons intersection-points index lists and intersection count</span></div><div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;        <span class="comment">// Update polygon group lists </span></div><div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;        </div><div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;        <span class="comment">// Append temp intersection points array to permanent one</span></div><div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;        intPtsList.insert(intPtsList.end(),tempIntPts.begin(),tempIntPts.end()); </div><div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;</div><div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;        <span class="comment">// Update poly&#39;s indexs to intersections list (intpts)</span></div><div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; tempIntersectList.size(); i++) {</div><div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;            <span class="comment">// Update each intersected poly&#39;s intersection index</span></div><div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;            </div><div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;            acceptedPoly[tempIntersectList[i]].intersectionIndex.push_back(intPtsIndex + i); </div><div class="line"><a name="l00962"></a><span class="lineno">  962</span>&#160;            <span class="comment">// intPtsIndex+i will be the index position of the intersection once it is saved to the intersections array</span></div><div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;        }</div><div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;                    </div><div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;        <span class="comment">// Fracture is now accepted.</span></div><div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        <span class="comment">// Update intersection structures with triple intersection points.</span></div><div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;        <span class="comment">// triple intersection points will be found 3 times (3 fractures make up one triple int point)</span></div><div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;        <span class="comment">// We need only to save the point to the permanent triplePoints array once, and then give each intersection a</span></div><div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;        <span class="comment">// reference to it. </span></div><div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="input_8h.html#aa0b6ecd1182eec9769b157aa8387e32c">tripleIntersections</a> == 1) {</div><div class="line"><a name="l00971"></a><span class="lineno">  971</span>&#160;            <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tripIndex = triplePoints.size();            </div><div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = 0; j &lt; tempData.size(); j++) { <span class="comment">// Loop through newly found triple points        </span></div><div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;            </div><div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;                triplePoints.push_back(tempData[j].triplePoint);</div><div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;                </div><div class="line"><a name="l00976"></a><span class="lineno">  976</span>&#160;                <span class="comment">// Update index pointers to the triple intersection points</span></div><div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;                <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ii = 0; ii &lt; tempData[j].intIndex.size(); ii++) {</div><div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;                    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx = tempData[j].intIndex[ii];</div><div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;                    intPtsList[idx].triplePointsIdx.push_back(tripIndex + j);</div><div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;                }</div><div class="line"><a name="l00981"></a><span class="lineno">  981</span>&#160;            }    </div><div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;        }        </div><div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;</div><div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;        <span class="comment">// ***********************</span></div><div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;        <span class="comment">// Update group numbers **</span></div><div class="line"><a name="l00986"></a><span class="lineno">  986</span>&#160;        <span class="comment">// *********************** </span></div><div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        <a class="code" href="cluster_groups_8cpp.html#aa67c48c94718510ec7bd5590f09d090c">updateGroups</a>(newPoly, acceptedPoly, encounteredGroups, pstats, newPolyIndex);</div><div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;    }</div><div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;    </div><div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;    <span class="comment">// Keep track of how much intersection length we are looising from &#39;shrinkIntersection()&#39;</span></div><div class="line"><a name="l00991"></a><span class="lineno">  991</span>&#160;    <span class="comment">// Calculate and store total original intersection length (all intersections)</span></div><div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;    <span class="comment">// and actual intersection length, after intersection has been shortened.</span></div><div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; tempIntPts.size(); i++) {</div><div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;        <span class="keywordtype">double</span> length = <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> - tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, </div><div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;                                  tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> - tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, </div><div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;                                  tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> - tempOriginalIntersection[i].<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>);</div><div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;        </div><div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;        pstats.<a class="code" href="struct_stats.html#a8cf48c5b0b96005ef7dbb03cceaf9003">originalLength</a> += length;</div><div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;        </div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;        <span class="keywordflow">if</span> (tempIntPts[i].<a class="code" href="struct_int_points.html#a5a3f21b54443313c41a69a05c043cefd">intersectionShortened</a> == <span class="keyword">true</span>) {</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;            pstats.<a class="code" href="struct_stats.html#ae27fc3d500d31275f8d97fde166b055c">intersectionsShortened</a>++;</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;            </div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;            <span class="keywordtype">double</span> newLength = <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(tempIntPts[i].<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a> - tempIntPts[i].x2, </div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>&#160;                                         tempIntPts[i].<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a> - tempIntPts[i].y2, </div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;                                         tempIntPts[i].<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a> - tempIntPts[i].z2);</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;            pstats.<a class="code" href="struct_stats.html#a5cd7cf21a73c6d359b63732ef1d7eebb">discardedLength</a> += length - newLength;</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;        }</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;    }</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;    <span class="keywordflow">return</span> 0;        </div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;}</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;<span class="comment">/********************************************************************************************/</span></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;<span class="comment">/* Disatance from intersection line to Nodes/Vertices  *************************************/</span></div><div class="line"><a name="l01022"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a63cb49a89f3b90a72aea7b6a24548633"> 1022</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#a95b1277bb056c0817776be85b254c987">checkDistanceFromNodes</a>(<span class="keyword">struct</span> <a class="code" href="struct_poly.html">Poly</a> &amp;poly, <a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <span class="keywordtype">double</span> minDist, <a class="code" href="struct_stats.html">Stats</a> &amp;pstats) {</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;    <span class="keywordtype">int</span> nNodes = poly.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>;</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;    <span class="keywordtype">double</span> dist;</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>&#160;    </div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;    <span class="comment">// Intersection dist to poly vertices</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;    <span class="keywordtype">double</span> line[6] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>, intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>};</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;    dist = <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(poly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>, line);</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; nNodes; i++) {</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>&#160;        <span class="keywordtype">int</span> idx = 3*i;</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;        <span class="keywordtype">double</span> temp = <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;poly.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx], line);</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;        <span class="comment">// If new distance is less than the last calculated distance...</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;        <span class="keywordflow">if</span> (temp &lt; dist) { </div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;            dist = temp;</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>&#160;        }</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;        <span class="keywordflow">if</span> (dist &lt; minDist &amp;&amp; dist &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) { </div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;            pstats.<a class="code" href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">rejectionReasons</a>.<a class="code" href="struct_rejection_reasons.html#ac581f8584a6bc05181a18c9145f2a26e">closeToNode</a>++;</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;            <span class="keywordflow">return</span> 1; </div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;        }    </div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;    }</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>&#160;    </div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;    <span class="comment">// If it makes it here, no distance less than &#39;minDist&#39; found</span></div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;} </div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;<span class="comment">/******************** Shortest Disatance, point to line seg *********************/</span></div><div class="line"><a name="l01054"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2"> 1054</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> *point, <span class="keyword">const</span> <span class="keywordtype">double</span> *line) {</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> sqrLineLen = <a class="code" href="vector_functions_8h.html#ad5177d4868472616bd9fac80a8b65f78">sqrMagnitude</a>(line[0]-line[3], line[1]-line[4], line[2]-line[5]);  <span class="comment">// i.e. |w-v|^2 -  avoid a sqrt</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;    <span class="keywordflow">if</span> (sqrLineLen &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;        <span class="comment">// Line endpoints are equal to each other</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(point[0]-line[0], point[1]-line[1], point[2]-line[2]);</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;    }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>&#160;    <span class="keywordtype">double</span> pL1[3] = { point[0]-line[0], point[1]-line[1], point[2]-line[2] };</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;    <span class="keywordtype">double</span> L1L2[3] = { line[3]-line[0], line[4]-line[1], line[5]-line[2] };</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;    <span class="comment">// Find parameterization for line projection on [0, 1]</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> t = std::max(0.0, std::min(1.0, <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(pL1, L1L2) / sqrLineLen));</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>&#160;    <span class="keywordtype">double</span> <a class="code" href="vector_functions_8cpp.html#a3c2b95a1658779bf4d2b104fa9513e75">projection</a>[3] = { t * L1L2[0], t * L1L2[1], t * L1L2[2] };</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;    projection[0] += line[0];</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;    projection[1] += line[1];</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;    projection[2] += line[2];</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(projection[0]-point[0], projection[1]-point[1], projection[2]-point[2]);</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>&#160;}</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;<span class="comment">// Overloaded function </span></div><div class="line"><a name="l01079"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#ad263d6aadd25eaf48d5fe67b6b7e7a2a"> 1079</a></span>&#160;<span class="comment"></span><span class="keywordtype">double</span> <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(<span class="keyword">const</span> <a class="code" href="struct_point.html">Point</a> &amp;point, <span class="keyword">const</span> <span class="keywordtype">double</span> *line) {</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> sqrLineLen = <a class="code" href="vector_functions_8h.html#ad5177d4868472616bd9fac80a8b65f78">sqrMagnitude</a>(line[0]-line[3], line[1]-line[4], line[2]-line[5]);  <span class="comment">// i.e. |w-v|^2 -  avoid a sqrt</span></div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;    <span class="keywordflow">if</span> (sqrLineLen &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;        <span class="comment">// Line endpoints are equal to each other</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(point.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>-line[0], point.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>-line[1], point.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>-line[2]);</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;    }</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>&#160;    <span class="keywordtype">double</span> pL1[3] = { point.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>-line[0], point.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>-line[1], point.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>-line[2] };</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;    <span class="keywordtype">double</span> L1L2[3] = { line[3]-line[0], line[4]-line[1], line[5]-line[2] };</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;    <span class="comment">// Find parameterization for line projection on [0, 1]</span></div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> t = std::max(0.0, std::min(1.0, <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(pL1, L1L2) / sqrLineLen));</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>&#160;    <span class="keywordtype">double</span> <a class="code" href="vector_functions_8cpp.html#a3c2b95a1658779bf4d2b104fa9513e75">projection</a>[3] = { t * L1L2[0], t * L1L2[1], t * L1L2[2] };</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;    projection[0] += line[0];</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;    projection[1] += line[1];</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;    projection[2] += line[2];</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(projection[0]-point.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>, projection[1]-point.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>, projection[2]-point.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>);</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>&#160;}</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;<span class="comment">/*******************************************************************************/</span></div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;<span class="comment">/************************* Is Point On Line Segment ****************************/</span></div><div class="line"><a name="l01108"></a><span class="lineno"><a class="line" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c"> 1108</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> *pt, <span class="keyword">const</span> <span class="keywordtype">double</span> *line) {</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;    <span class="comment">// A = end pt 1, B = end pt 2, </span></div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;    <span class="comment">// pt is point we are checking if on line between A and B</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;    <span class="comment">// If mag(A to Pt) + mag(pt to B) = mag(A to B), pt is on line</span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;    <span class="comment">// end point A to end point B</span></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;    <span class="keywordtype">double</span> temp[3] = { line[3]-line[0], line[4]-line[1], line[5]-line[2] };</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>&#160;</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;    <span class="keywordtype">double</span> endPttoEndPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;    <span class="comment">// end point A to pt</span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;    temp[0] = pt[0] - line[0];</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;    temp[1] = pt[1] - line[1];</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>&#160;    temp[2] = pt[2] - line[2];</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;    <span class="keywordtype">double</span> endPtToPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;    <span class="comment">// pt to end pt B</span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;    temp[0] = line[3] - pt[0];</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;    temp[1] = line[4] - pt[1];</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;    temp[2] = line[5] - pt[2];</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>&#160;    <span class="keywordtype">double</span> ptToEndPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;    <span class="comment">// (end pt A to pt) + (pt to end pt B) - (end pt to end pt)</span></div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;    <span class="comment">// If zero, pt is between endpoints, and on line</span></div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;    <span class="keywordtype">double</span> result  = endPtToPt_Dist + ptToEndPt_Dist - endPttoEndPt_Dist;</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>&#160;    <span class="keywordflow">if</span> (-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &lt; result &amp;&amp; result &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;    }</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;}</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>&#160;</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;<span class="comment">// Overloaded function</span></div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;<span class="comment">/************************* Is Point On Line Segment ****************************/</span></div><div class="line"><a name="l01151"></a><span class="lineno"><a class="line" href="computational_geometry_8cpp.html#a26684f20241548e01da824ff9248207f"> 1151</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(<span class="keyword">const</span> <a class="code" href="struct_point.html">Point</a> &amp;pt, <span class="keyword">const</span> <span class="keywordtype">double</span> *line) {</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;    <span class="comment">// A = end pt 1, B = end pt 2, </span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>&#160;    <span class="comment">// pt is point we are checking if on line between A and B</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;    <span class="comment">// If mag(A to Pt) + mag(pt to B) = mag(A to B), pt is on line</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;    <span class="comment">//end point A to end point B</span></div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160;    <span class="keywordtype">double</span> temp[3] = { line[3]-line[0], line[4]-line[1], line[5]-line[2] };</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>&#160;</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;    <span class="keywordtype">double</span> endPttoEndPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;    <span class="comment">//end point A to pt</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;    temp[0] = pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a> - line[0];</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;    temp[1] = pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a> - line[1];</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;    temp[2] = pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a> - line[2];</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>&#160;    <span class="keywordtype">double</span> endPtToPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;    <span class="comment">//pt to end pt B</span></div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;    temp[0] = line[3] - pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>;</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;    temp[1] = line[4] - pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>;</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;    temp[2] = line[5] - pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>;</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160;    <span class="keywordtype">double</span> ptToEndPt_Dist = std::sqrt(temp[0] * temp[0] + temp[1] * temp[1] + temp[2] * temp[2]);</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;</div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;    <span class="comment">// (end pt A to pt) + (pt to end pt B) - (end pt to end pt)</span></div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;    <span class="comment">// if zero, pt is between and on line</span></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;    <span class="keywordtype">double</span> result  = endPtToPt_Dist + ptToEndPt_Dist - endPttoEndPt_Dist;</div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;    <span class="keywordflow">if</span> (-<a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &lt; result &amp;&amp; result &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;    }</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;}</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;<span class="comment">/****************** Check if nodes are too close to edge ************************/</span></div><div class="line"><a name="l01197"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#adf34efb0050985566dfb41f51967680f"> 1197</a></span>&#160;<span class="keywordtype">bool</span> <a class="code" href="computational_geometry_8cpp.html#adf34efb0050985566dfb41f51967680f">checkCloseEdge</a>(<a class="code" href="struct_poly.html">Poly</a> &amp;poly1, <a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <span class="keywordtype">double</span> shrinkLimit, <a class="code" href="struct_stats.html">Stats</a> &amp;pstats) { </div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;    <span class="comment">// &#39;line&#39; is newest intersection end points</span></div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;    <span class="keywordtype">double</span> line[6] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>, intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>};</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160;    <span class="comment">// minDist is the minimum distance allowed from an end point to the edge of a polygon</span></div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;    <span class="comment">// if the intersection does not land accross a poly&#39;s edge</span></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;    <span class="keywordtype">double</span> minDist = <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>;</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;    <span class="comment">// Counts how many endPoints are on the polys edge.</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;    <span class="comment">// If both end points of intersection are on polys edge,</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;    <span class="comment">// we must check the distance from end points to </span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160;    <span class="comment">// vertices</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;    <span class="keywordtype">int</span> onEdgeCount = 0;</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; poly1.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a>; i++) {</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;        <span class="keywordtype">int</span> next;</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;        <span class="keywordtype">int</span> idx = 3*i;</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;        </div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;        <span class="keywordflow">if</span> (i != poly1.<a class="code" href="struct_poly.html#a8cc8d6067e940d33a1b29844b3e8c6ec">numberOfNodes</a> -1) { </div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;            next = (i+1)*3;</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;        }</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160;        <span class="keywordflow">else</span>{ <span class="comment">// If last edge on polygon</span></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160;            next = 0;</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160;        }    </div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;            </div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;        <span class="comment">// Edge is two points, x y and z coords of poly vertices</span></div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;        <span class="keywordtype">double</span> edge[6] = {poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx],poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+1],poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[idx+2], </div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;                         poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next], poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next+1], poly1.<a class="code" href="struct_poly.html#a2cb519bcf0553215de907c8fc878a255">vertices</a>[next+2]};</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160;        <a class="code" href="struct_point.html">Point</a> pt; <span class="comment">// &#39;pt&#39; is point of intersection, set in lineSegToLineSeg()</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>&#160;</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160;        <span class="comment">// Get distances of each point to line</span></div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160;        <span class="keywordtype">double</span> endPtsToEdge[4] = { <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;line[0], edge), <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;line[3], edge), </div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160;                                   <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;edge[0], line), <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;edge[3], line) };</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160;        </div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160;        <span class="comment">// Sort smallest to largest</span></div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;        std::sort(endPtsToEdge, endPtsToEdge + 4);</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160;        <span class="comment">// If two smallest distances are &lt; h, </span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;        <span class="comment">// the line is almost parallel and closer to edge than h, reject it</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;        <span class="keywordflow">if</span> ((endPtsToEdge[0] &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a> &amp;&amp; endPtsToEdge[1] &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) &amp;&amp; endPtsToEdge[0] &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;            <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;        }        </div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160;</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;        <span class="comment">// Minimum dist from poly edge segment to intersection segment</span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;        <span class="keywordtype">double</span> dist = <a class="code" href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a>(edge, line, pt);</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160;</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;        <span class="keywordflow">if</span> (dist &lt; minDist &amp;&amp; dist &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {   </div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;            <span class="comment">// Try to shrink the intersection slightly in order to </span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;            <span class="comment">// not reject the polygon</span></div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;            <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#a69f93a65c39c49d1b705fad32f790e98">shrinkIntersection</a>(intPts, edge, shrinkLimit, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) == 1) {</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;                <span class="comment">// Returns one if insterection shrinks to less than .9*h</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;                <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;            }</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;        }</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (dist &lt; eps) {</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;            <span class="comment">// Endpoint is almost exactly on poly&#39;s edge, must check </span></div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>&#160;            <span class="comment">// whether the discretized nodes will ne closer </span></div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;            <span class="comment">// than the minimum allowed distance</span></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;            <span class="comment">// shrinkIntersection() will check if the descretized intersection points violate any </span></div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;            <span class="comment">// distance to edge rules  </span></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;            <span class="comment">// NOTE: Intersections discretize with set size = .5*h</span></div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;            <span class="comment">// Minimum distance to edge must be less than .5*h to allow for angles    </span></div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160;            <span class="keyword">const</span> <span class="keyword">static</span> <span class="keywordtype">double</span> minDist2 = 0.4 * <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>;</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;            <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#a69f93a65c39c49d1b705fad32f790e98">shrinkIntersection</a>(intPts, edge, shrinkLimit, minDist2, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) == 1) {</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;                <span class="comment">//returns one if insterection shrinks to less than .9*h</span></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;                <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;            }</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;            </div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;            onEdgeCount++;</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160;</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;            <span class="comment">// If both end points are on the edge we must also check the distnace </span></div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;            <span class="comment">// of the intersection to the poly vertices. </span></div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;            <span class="comment">// IF the intersecion is within the polygon, distances less than h to </span></div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;            <span class="comment">// edges and vertices will be caught by lineSegToLineSeg() in this function.</span></div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;            <span class="keywordflow">if</span> (onEdgeCount &gt;= 2) {</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;                </div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;                <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#a95b1277bb056c0817776be85b254c987">checkDistanceFromNodes</a>(poly1, intPts, <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>, pstats)) {</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160;                    <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;                }</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;            }</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160;        }</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160;</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160;    }</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160;<span class="preprocessor">    #ifdef DISABLESHORTENINGINT</span></div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160;        <span class="keywordflow">if</span> (intPts.<a class="code" href="struct_int_points.html#a5a3f21b54443313c41a69a05c043cefd">intersectionShortened</a> == <span class="keyword">true</span>) {</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;            <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>&#160;        }</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160;<span class="preprocessor">    #endif</span></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160;    </div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160;}</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160;</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160;</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160;<span class="comment">/*****************  Find point of intersection between two lines ****************/</span></div><div class="line"><a name="l01302"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a9eb32a7555c136fb7960f9f13db70004"> 1302</a></span>&#160;<a class="code" href="struct_point.html">Point</a> <a class="code" href="computational_geometry_8cpp.html#a9eb32a7555c136fb7960f9f13db70004">lineIntersection3D</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> *p1, <span class="keywordtype">double</span> *v1, <span class="keyword">const</span> <span class="keywordtype">double</span> *p2, <span class="keywordtype">double</span> *v2) {</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>&#160;    <a class="code" href="vector_functions_8h.html#a48bb00fc4195377b229efe044f3bb67e">normalize</a>(v1);</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160;    <a class="code" href="vector_functions_8h.html#a48bb00fc4195377b229efe044f3bb67e">normalize</a>(v2);</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160;    </div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160;    <span class="keywordtype">double</span> v1xv2[3] = {(v1[1]*v2[2])-(v1[2]*v2[1]), (v1[2]*v2[0])-(v1[0]*v2[2]), (v1[0]*v2[1])-(v1[1]*v2[0])};</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160;    <span class="keywordtype">double</span> denom = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(v1xv2, v1xv2);</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160;    <span class="keywordtype">double</span> v21[3] = {p2[0]-p1[0], p2[1]-p1[1], p2[2]-p1[2]};</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160;    <span class="keywordtype">double</span> v21xv2[3] = {(v21[1]*v2[2])-(v21[2]*v2[1]), (v21[2]*v2[0])-(v21[0]*v2[2]), (v21[0]*v2[1])-(v21[1]*v2[0])};</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160;    <span class="keywordtype">double</span> temp[3];</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160;    <span class="keywordtype">double</span> temp2 = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(v21xv2, v1xv2);</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160;    <span class="keywordtype">double</span> temp3 = temp2/denom;</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160;    temp[0] = v1[0]*temp3;</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160;    temp[1] = v1[1]*temp3;</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160;    temp[2] = v1[2]*temp3;</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>&#160;        </div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160;    <a class="code" href="struct_point.html">Point</a> pt;</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160;    pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a> = temp[0] + p1[0];  </div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160;    pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a> = temp[1] + p1[1];  </div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160;    pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a> = temp[2] + p1[2];  </div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160;    </div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>&#160;    <span class="keywordflow">return</span> pt;</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160;}</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160;</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160;</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160;<span class="comment">/************  Closest Distance from Line Seg to Line Seg ***********************/</span></div><div class="line"><a name="l01338"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a5edbf5558b99624dfb90275aa07ba149"> 1338</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> *line1, <span class="keyword">const</span> <span class="keywordtype">double</span> *line2, <a class="code" href="struct_point.html">Point</a> &amp;pt) {</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160;</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160;    <span class="comment">// Check if line 1 and line 2 intersect</span></div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> p1[3] = {line1[0], line1[1], line1[2]};</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">double</span> p2[3] = {line2[0], line2[1], line2[2]};</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160;    <span class="keywordtype">double</span> v1[3];</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160;    v1[0] = line1[0] - line1[3];</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160;    v1[1] = line1[1] - line1[4];</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160;    v1[2] = line1[2] - line1[5];</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160;    <span class="keywordtype">double</span> v2[3];</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160;    v2[0] = line2[0] - line2[3];</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160;    v2[1] = line2[1] - line2[4];</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160;    v2[2] = line2[2] - line2[5];</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160;    </div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160;    <span class="keywordtype">double</span> p1p2[3] = {p1[0]-p2[0], p1[1]-p2[1], p1[2]-p2[2]};</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160;    </div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="vector_functions_8h.html#a7038a32284147d86abda1f0b54b83a4e">parallel</a>(v1, v2)) {</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="vector_functions_8h.html#a92da2058f3ed2a6db16d2fe0e445794a">magnitude</a>(p1p2[0], p1p2[1], p1p2[2]) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> || <a class="code" href="vector_functions_8h.html#a7038a32284147d86abda1f0b54b83a4e">parallel</a>(p1p2, v1) == 1) {</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160;            <span class="comment">// If 2 line segs overlap</span></div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160;            <span class="keywordflow">if</span>(<a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(line1, line2) == 1 || <a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(&amp;line1[3], line2) == 1) {</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160;                <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160;            }</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160;            <span class="keywordflow">else</span> { <span class="comment">// Line segs are colinear but not overlapping</span></div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160;                <span class="keywordflow">return</span> <a class="code" href="computational_geometry_8cpp.html#a545f45434dcbd126c6ff994b9ec2588b">lineSegToLineSegSep</a>(line1, line2);</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>&#160;            }    </div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160;        }  </div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160;        <span class="keywordflow">else</span> {<span class="comment">// Line segs are parallel but not overlapping</span></div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="computational_geometry_8cpp.html#a545f45434dcbd126c6ff994b9ec2588b">lineSegToLineSegSep</a>(line1, line2);</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160;        }</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;    }    </div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;    <span class="keywordflow">else</span>{ <span class="comment">// Lines are not parallel</span></div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;        pt = <a class="code" href="computational_geometry_8cpp.html#a9eb32a7555c136fb7960f9f13db70004">lineIntersection3D</a>(p1, v1, p2, v2); <span class="comment">// Point of intersection if lines intersect</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;        <span class="keywordtype">double</span> temp[3] = {pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>, pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>, pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>};</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;        <span class="keywordflow">if</span> (<a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(temp, line1) &amp;&amp; <a class="code" href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a>(temp, line2)) { <span class="comment">// Case 1: Lines Intersection occurs on the lines</span></div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>&#160;            <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160;        }</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>&#160;        <span class="keywordflow">else</span> {<span class="comment">// Case 2: Line Intersection does not occur on both lines, find min distance from 4 endpoints to other line seg</span></div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>&#160;            <span class="keywordflow">return</span> <a class="code" href="computational_geometry_8cpp.html#a545f45434dcbd126c6ff994b9ec2588b">lineSegToLineSegSep</a>(line1, line2);</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>&#160;        }</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>&#160;    }</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>&#160;}</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>&#160;</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>&#160;<span class="comment">/********** Dist. from line seg to line seg (seperated lines) *******************/</span></div><div class="line"><a name="l01389"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a545f45434dcbd126c6ff994b9ec2588b"> 1389</a></span>&#160;<span class="keywordtype">double</span> <a class="code" href="computational_geometry_8cpp.html#a545f45434dcbd126c6ff994b9ec2588b">lineSegToLineSegSep</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> *line1, <span class="keyword">const</span> <span class="keywordtype">double</span> *line2) {</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>&#160;    <span class="keywordtype">double</span> dist = std::min(<a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(line1, line2), <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;line1[3], line2));</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>&#160;    <span class="keywordtype">double</span> temp = std::min(<a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(line2, line1), <a class="code" href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a>(&amp;line2[3], line1));</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>&#160; </div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>&#160;    <span class="keywordflow">if</span> (dist &lt; temp) <span class="keywordflow">return</span> dist;</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>&#160;    <span class="keywordflow">else</span> <span class="keywordflow">return</span> temp;</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>&#160;}</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>&#160;</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>&#160;</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>&#160;<span class="comment">/************** Check for Triple Intersection , get int. point ******************/</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>&#160;<span class="comment">/********************************************************************************/</span></div><div class="line"><a name="l01412"></a><span class="lineno"><a class="line" href="computational_geometry_8h.html#a237899188f8ca6cf74a2da890cd13868"> 1412</a></span>&#160;<span class="keywordtype">int</span> <a class="code" href="computational_geometry_8cpp.html#a237899188f8ca6cf74a2da890cd13868">checkForTripleIntersections</a>(<a class="code" href="struct_int_points.html">IntPoints</a> &amp;intPts, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> count, std::vector&lt;IntPoints&gt; &amp;intPtsList, <a class="code" href="struct_poly.html">Poly</a> &amp;newPoly, <a class="code" href="struct_poly.html">Poly</a> &amp;poly2, std::vector&lt;TriplePtTempData&gt; &amp;tempData,  std::vector&lt;Point&gt; &amp;triplePoints) {</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160;    </div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;    <a class="code" href="struct_point.html">Point</a> pt;</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;    <span class="keywordtype">double</span> minDist = 1.5*<a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>;</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;    <span class="keywordtype">double</span> intEndPts[6] = {intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>, intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a>};<span class="comment">//newest intersection</span></div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;    </div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160;    <span class="comment">// Number of intersections already on poly2 </span></div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>&#160;    <span class="keywordtype">int</span> n = poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>.size();</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;    <span class="comment">// Check new fracure&#39;s new intesrsection against previous intersections on poly2</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) { </div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> intersectionIndex = poly2.<a class="code" href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">intersectionIndex</a>[i]; <span class="comment">// Index to previous intersecction (old intersection)</span></div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> intersectionIndex2 = intPtsList.size() + count; <span class="comment">// Index to current intersection, if accepted (new intersection)</span></div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;        </div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;        <span class="keywordtype">double</span> line[6] = {intPtsList[intersectionIndex].x1, intPtsList[intersectionIndex].y1, intPtsList[intersectionIndex].z1, intPtsList[intersectionIndex].x2, intPtsList[intersectionIndex].y2, intPtsList[intersectionIndex].z2};</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;        <span class="keywordtype">double</span> dist1 = <a class="code" href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a>(intEndPts, line, pt); <span class="comment">//get distance and pt of intersection</span></div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160;        </div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;    <span class="keywordflow">if</span> (dist1 &gt;= <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;        <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;    }</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160;    <span class="keywordflow">if</span> (<a class="code" href="input_8h.html#aa0b6ecd1182eec9769b157aa8387e32c">tripleIntersections</a> == 0 &amp;&amp; dist1 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;        <span class="keywordflow">return</span> -10; <span class="comment">// Triple intersections not allowed (user input option)</span></div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;    }</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160;    </div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;    <span class="keywordflow">if</span> (dist1 &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> &amp;&amp; dist1 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>&#160;        <span class="keywordflow">return</span> -11; <span class="comment">// Point too close to other intersection</span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;    }</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;    </div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;    <span class="comment">// Overlaping intersections</span></div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;    <span class="keywordflow">if</span> (dist1 &lt;= <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160;        <span class="comment">// ANGLE CHECK, using definition of dot product: A dot B = Mag(A)*Mag(B) * Cos(angle)</span></div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160;        <span class="comment">// Normalize  A and B first. Compare to precalculated values of cos(47deg)= .681998 and cos(133deg)= -.681998</span></div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160;        <span class="keywordtype">double</span> U[3] =  {line[3]-line[0], line[4]-line[1], line[5]-line[2]};</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160;        <span class="keywordtype">double</span> V[3] = {intPts.<a class="code" href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">x2</a> - intPts.<a class="code" href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">x1</a>, intPts.<a class="code" href="struct_int_points.html#a899541257522a3746d9883113864a0c1">y2</a> - intPts.<a class="code" href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">y1</a>, intPts.<a class="code" href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">z2</a> - intPts.<a class="code" href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">z1</a>}; <span class="comment">//endpoints</span></div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160;        <a class="code" href="vector_functions_8h.html#a48bb00fc4195377b229efe044f3bb67e">normalize</a>(U);</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160;        <a class="code" href="vector_functions_8h.html#a48bb00fc4195377b229efe044f3bb67e">normalize</a>(V);</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;    </div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;        <span class="keywordtype">double</span> dotProd = <a class="code" href="vector_functions_8h.html#abb1d4beb5939c7a5ddd4978c15fab7bb">dotProduct</a>(U,V);</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;    </div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;        <span class="keywordflow">if</span> (dotProd &lt; -0.68199836 || dotProd &gt; 0.68199836) { <span class="comment">//if angle is less than 47 deg or greater than 133, reject </span></div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160;            <span class="keywordflow">return</span> -12;</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>&#160;        }</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160;    </div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160;        <span class="comment">// Check that the triple intersection point isn&#39;t too close to an endpoint</span></div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160;        <span class="keywordtype">double</span> dist2;</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>&#160;        <span class="keywordtype">double</span> point[3] = {pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>, pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>, pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a>}; <span class="comment">// Triple intersection point</span></div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160;        dist1 = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point,intEndPts);</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160;        dist2 = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point,&amp;intEndPts[3]);</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160;        <span class="keywordflow">if</span> (dist1 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a> || dist2 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160;            <span class="keywordflow">return</span> -13;</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>&#160;        }</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>&#160;        dist1 = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point,line);</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>&#160;        dist2 = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point,&amp;line[3]);</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>&#160;        <span class="keywordflow">if</span> (dist1 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a> || dist2 &lt; <a class="code" href="input_8h.html#a8ee9be1b5aa75abae556de3088cba6d9">h</a>) {</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>&#160;            <span class="keywordflow">return</span> -13;</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>&#160;        }</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>&#160;        </div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>&#160;        <span class="comment">// Check that the triple intersection point isn&#39;t too close to previous triple intersection points</span></div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k = 0; k &lt; intPtsList[intersectionIndex].triplePointsIdx.size(); k++) {</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>&#160;            <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> idx =  intPtsList[intersectionIndex].triplePointsIdx[k];</div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>&#160;            <span class="keywordtype">double</span> triplePt[3] = {triplePoints[idx].x, triplePoints[idx].y,triplePoints[idx].z};</div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>&#160;            dist1 = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point, triplePt);</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>&#160;            <span class="keywordflow">if</span> (dist1 &lt; minDist) {</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>&#160;                <span class="keywordflow">return</span> -14;</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>&#160;            }</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>&#160;        }</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>&#160;    </div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>&#160;        <span class="comment">// Look at previously found triple points on current line of intersection,</span></div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>&#160;        <span class="comment">// do not save duplicate triple ponits</span></div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>&#160;        <span class="comment">// If duplicate point is found, a different intersection may still be needing an update</span></div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>&#160;        <span class="comment">// (three intersections per single triple intersection point )</span></div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>&#160;        <span class="keywordtype">bool</span> duplicate = 0;</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k;</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>&#160;        <span class="comment">// See if the found triple pt is already saved</span></div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>&#160;        <span class="keywordflow">for</span> (k = 0; k &lt; tempData.size(); k++) {     </div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>&#160;            <span class="keywordflow">if</span> (std::abs(pt.<a class="code" href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a> - tempData[k].triplePoint.x) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> </div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>&#160;            &amp;&amp;  std::abs(pt.<a class="code" href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a> - tempData[k].triplePoint.y) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> </div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>&#160;            &amp;&amp;  std::abs(pt.<a class="code" href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">z</a> - tempData[k].triplePoint.z) &lt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a>) {</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>&#160;                duplicate = 1;</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>&#160;                <span class="keywordflow">break</span>;</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>&#160;            }                </div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>&#160;        }</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>&#160;        </div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>&#160;        <span class="comment">// If it is a duplicate triple pt</span></div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>&#160;        <span class="keywordflow">if</span> (duplicate == 1) { </div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>&#160;            <span class="comment">// The old fracture&#39;s intersection needs </span></div><div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>&#160;            <span class="comment">// a reference to the new triple int pt</span></div><div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>&#160;            <span class="comment">// Save the index to the old fractures intersection</span></div><div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>&#160;            <span class="comment">// which needs updating. If newPoly is accpted</span></div><div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>&#160;            <span class="comment">// the old fracture will be updated </span></div><div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>&#160;            tempData[k].intIndex.push_back(intersectionIndex2);</div><div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>&#160;        }</div><div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>&#160;        <span class="keywordflow">else</span>{ <span class="comment">// Not a duplicate point </span></div><div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>&#160;            <span class="comment">// Save temp triple point data, store to permanent at end if fracture is accepted</span></div><div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>&#160;            <a class="code" href="struct_triple_pt_temp_data.html">TriplePtTempData</a> localTemp;</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>&#160;            localTemp.<a class="code" href="struct_triple_pt_temp_data.html#a3b5a4de3b697c9e081335d69b67dd64f">triplePoint</a> = pt;</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>&#160;            localTemp.<a class="code" href="struct_triple_pt_temp_data.html#ac16d38da02334b609c846cd86fcef6f0">intIndex</a>.push_back(intersectionIndex);</div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>&#160;            localTemp.<a class="code" href="struct_triple_pt_temp_data.html#ac16d38da02334b609c846cd86fcef6f0">intIndex</a>.push_back(intersectionIndex2);</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>&#160;            tempData.push_back(localTemp);</div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>&#160;        }</div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160;    }</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>&#160;}</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>&#160;</div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>&#160;    <span class="comment">// Test distances to triple points on own line of intersection</span></div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>&#160;    <span class="comment">// If any triple points are found to be less than &#39;minDist&#39; to each other, reject.</span></div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>&#160;    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> tripSize = tempData.size(); </div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>&#160;    <span class="comment">// Each tempData structure contains 1 triple pt and the intersection index of intersection it is on</span></div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>&#160;    </div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>&#160;    <span class="keywordflow">if</span> (tripSize != 0 ) {</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>&#160;        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y = tripSize-1;</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>&#160;</div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> k = 0; k &lt; y ; k++ ) {</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>&#160;            <span class="keywordtype">double</span> point1[3] = {tempData[k].triplePoint.x, tempData[k].triplePoint.y, tempData[k].triplePoint.z};</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>&#160;            <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> j = k+1; j &lt; tripSize; j++) {</div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>&#160;                <span class="keywordtype">double</span> point2[3] = {tempData[j].triplePoint.x, tempData[j].triplePoint.y, tempData[j].triplePoint.z};</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>&#160;                <span class="keywordtype">double</span> dist = <a class="code" href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a>(point1,point2);</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>&#160;                <span class="keywordflow">if</span> ( dist &lt; minDist &amp;&amp; dist &gt; <a class="code" href="_d_f_nmain_8cpp.html#a974b448c3d0a13d483d36ef15de369b5">eps</a> ) {</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>&#160;</div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>&#160;                    <span class="keywordflow">return</span> -14;</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>&#160;                }</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>&#160;            }</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>&#160;        }</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>&#160;    }</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>&#160;    <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>&#160;}</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>&#160;</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>&#160;</div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>&#160;</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>&#160;</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>&#160;</div><div class="ttc" id="computational_geometry_8cpp_html_a3098cccf29c7a47d2eae661b0f545224"><div class="ttname"><a href="computational_geometry_8cpp.html#a3098cccf29c7a47d2eae661b0f545224">translate</a></div><div class="ttdeci">void translate(Poly &amp;newPoly, double *translation)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00047">computationalGeometry.cpp:47</a></div></div>
<div class="ttc" id="vector_functions_8cpp_html_af04ebdcbe44a303101290e88a5971c71"><div class="ttname"><a href="vector_functions_8cpp.html#af04ebdcbe44a303101290e88a5971c71">euclideanDistance</a></div><div class="ttdeci">double euclideanDistance(double *A, double *B)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8cpp_source.html#l00046">vectorFunctions.cpp:46</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_abdfd17162db7fd7ad2e4719255fa915f"><div class="ttname"><a href="computational_geometry_8cpp.html#abdfd17162db7fd7ad2e4719255fa915f">checkDistToNewIntersections</a></div><div class="ttdeci">bool checkDistToNewIntersections(std::vector&lt; IntPoints &gt; &amp;tempIntPts, IntPoints &amp;intPts, std::vector&lt; TriplePtTempData &gt; &amp;tempTriPts, double minDistance)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00712">computationalGeometry.cpp:712</a></div></div>
<div class="ttc" id="computational_geometry_8h_html"><div class="ttname"><a href="computational_geometry_8h.html">computationalGeometry.h</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a06628fbaa79aad7eec7a74c5341e77bd"><div class="ttname"><a href="computational_geometry_8cpp.html#a06628fbaa79aad7eec7a74c5341e77bd">polyAndIntersection_RotationToXY</a></div><div class="ttdeci">struct IntPoints polyAndIntersection_RotationToXY(struct IntPoints &amp;intersection, Poly &amp;newPoly, std::vector&lt; Point &gt; &amp;triplePoints, std::vector&lt; Point &gt; &amp;tempTripPts)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00207">computationalGeometry.cpp:207</a></div></div>
<div class="ttc" id="struct_poly_html_add8e39b7f48274757f46c80014aaeb6b"><div class="ttname"><a href="struct_poly.html#add8e39b7f48274757f46c80014aaeb6b">Poly::groupNum</a></div><div class="ttdeci">unsigned int groupNum</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00030">structures.h:30</a></div></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="vector_functions_8h_html_a48bb00fc4195377b229efe044f3bb67e"><div class="ttname"><a href="vector_functions_8h.html#a48bb00fc4195377b229efe044f3bb67e">normalize</a></div><div class="ttdeci">void normalize(T *vec)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00036">vectorFunctions.h:36</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="math_functions_8cpp_html_a50249713d75d2446b44572f47cc0c560"><div class="ttname"><a href="math_functions_8cpp.html#a50249713d75d2446b44572f47cc0c560">sortedIndex</a></div><div class="ttdeci">int * sortedIndex(const double *v, int n)</div><div class="ttdef"><b>Definition:</b> <a href="math_functions_8cpp_source.html#l00088">mathFunctions.cpp:88</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_aa650b6516110395f670252cb55f896c0"><div class="ttname"><a href="struct_poly.html#aa650b6516110395f670252cb55f896c0">Poly::boundingBox</a></div><div class="ttdeci">double boundingBox[6]</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00062">structures.h:62</a></div></div>
<div class="ttc" id="struct_rejection_reasons_html_ab935b00ed9bf36d47d435a3f4fbd328d"><div class="ttname"><a href="struct_rejection_reasons.html#ab935b00ed9bf36d47d435a3f4fbd328d">RejectionReasons::shortIntersection</a></div><div class="ttdeci">unsigned long long int shortIntersection</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00252">structures.h:252</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="struct_rejection_reasons_html_ac581f8584a6bc05181a18c9145f2a26e"><div class="ttname"><a href="struct_rejection_reasons.html#ac581f8584a6bc05181a18c9145f2a26e">RejectionReasons::closeToNode</a></div><div class="ttdeci">unsigned long long int closeToNode</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00255">structures.h:255</a></div></div>
<div class="ttc" id="struct_rejection_reasons_html_adbb08b81bcca27734f30fc8314a48719"><div class="ttname"><a href="struct_rejection_reasons.html#adbb08b81bcca27734f30fc8314a48719">RejectionReasons::closeToEdge</a></div><div class="ttdeci">unsigned long long int closeToEdge</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00258">structures.h:258</a></div></div>
<div class="ttc" id="struct_rejection_reasons_html_a71e3bcee9eb7d5eb99f60ec8832a8754"><div class="ttname"><a href="struct_rejection_reasons.html#a71e3bcee9eb7d5eb99f60ec8832a8754">RejectionReasons::triple</a></div><div class="ttdeci">unsigned long long int triple</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00264">structures.h:264</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a5edbf5558b99624dfb90275aa07ba149"><div class="ttname"><a href="computational_geometry_8cpp.html#a5edbf5558b99624dfb90275aa07ba149">lineSegToLineSeg</a></div><div class="ttdeci">double lineSegToLineSeg(const double *line1, const double *line2, Point &amp;pt)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01338">computationalGeometry.cpp:1338</a></div></div>
<div class="ttc" id="struct_stats_html_ae27fc3d500d31275f8d97fde166b055c"><div class="ttname"><a href="struct_stats.html#ae27fc3d500d31275f8d97fde166b055c">Stats::intersectionsShortened</a></div><div class="ttdeci">unsigned int intersectionsShortened</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00344">structures.h:344</a></div></div>
<div class="ttc" id="struct_int_points_html_a03e871983902c49f6b18dd6d5e71a3f3"><div class="ttname"><a href="struct_int_points.html#a03e871983902c49f6b18dd6d5e71a3f3">IntPoints::x2</a></div><div class="ttdeci">double x2</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00148">structures.h:148</a></div></div>
<div class="ttc" id="struct_stats_html_a8cf48c5b0b96005ef7dbb03cceaf9003"><div class="ttname"><a href="struct_stats.html#a8cf48c5b0b96005ef7dbb03cceaf9003">Stats::originalLength</a></div><div class="ttdeci">double originalLength</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00347">structures.h:347</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="struct_rejection_reasons_html_a8937dddd46dbdb1731e980500c02e1f3"><div class="ttname"><a href="struct_rejection_reasons.html#a8937dddd46dbdb1731e980500c02e1f3">RejectionReasons::interCloseToInter</a></div><div class="ttdeci">unsigned long long int interCloseToInter</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00267">structures.h:267</a></div></div>
<div class="ttc" id="struct_point_html"><div class="ttname"><a href="struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00111">structures.h:111</a></div></div>
<div class="ttc" id="cluster_groups_8cpp_html_a379930b3782e888c9ccdf5a8106b3434"><div class="ttname"><a href="cluster_groups_8cpp.html#a379930b3782e888c9ccdf5a8106b3434">assignGroup</a></div><div class="ttdeci">void assignGroup(Poly &amp;newPoly, Stats &amp;pstats, int newPolyIndex)</div><div class="ttdef"><b>Definition:</b> <a href="cluster_groups_8cpp_source.html#l00137">clusterGroups.cpp:137</a></div></div>
<div class="ttc" id="struct_int_points_html_a899541257522a3746d9883113864a0c1"><div class="ttname"><a href="struct_int_points.html#a899541257522a3746d9883113864a0c1">IntPoints::y2</a></div><div class="ttdeci">double y2</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00150">structures.h:150</a></div></div>
<div class="ttc" id="struct_point_html_afa38be143ae800e6ad69ce8ed4df62d8"><div class="ttname"><a href="struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">Point::y</a></div><div class="ttdeci">double y</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00113">structures.h:113</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_int_points_html_af2d7aa1594ac5c1a10de6bef0a5bee49"><div class="ttname"><a href="struct_int_points.html#af2d7aa1594ac5c1a10de6bef0a5bee49">IntPoints::y1</a></div><div class="ttdeci">double y1</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00144">structures.h:144</a></div></div>
<div class="ttc" id="vector_functions_8h_html_a7038a32284147d86abda1f0b54b83a4e"><div class="ttname"><a href="vector_functions_8h.html#a7038a32284147d86abda1f0b54b83a4e">parallel</a></div><div class="ttdeci">bool parallel(double *v1, double *v2)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00109">vectorFunctions.h:109</a></div></div>
<div class="ttc" id="struct_int_points_html_ad190f9e3aeb919a03d16baedbd108aa4"><div class="ttname"><a href="struct_int_points.html#ad190f9e3aeb919a03d16baedbd108aa4">IntPoints::z2</a></div><div class="ttdeci">double z2</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00152">structures.h:152</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_ab5f3ce14eaf1560295c9ec71514c340c"><div class="ttname"><a href="computational_geometry_8cpp.html#ab5f3ce14eaf1560295c9ec71514c340c">pointOnLineSeg</a></div><div class="ttdeci">bool pointOnLineSeg(const double *pt, const double *line)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01108">computationalGeometry.cpp:1108</a></div></div>
<div class="ttc" id="struct_int_points_html_aabd621fc15cbe6fd9cd8343b020d292a"><div class="ttname"><a href="struct_int_points.html#aabd621fc15cbe6fd9cd8343b020d292a">IntPoints::z1</a></div><div class="ttdeci">double z1</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00146">structures.h:146</a></div></div>
<div class="ttc" id="struct_stats_html_a3c0ec96761b92e70bbb96de0df58cce5"><div class="ttname"><a href="struct_stats.html#a3c0ec96761b92e70bbb96de0df58cce5">Stats::rejectionReasons</a></div><div class="ttdeci">struct RejectionReasons rejectionReasons</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00339">structures.h:339</a></div></div>
<div class="ttc" id="math_functions_8h_html"><div class="ttname"><a href="math_functions_8h.html">mathFunctions.h</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a95b1277bb056c0817776be85b254c987"><div class="ttname"><a href="computational_geometry_8cpp.html#a95b1277bb056c0817776be85b254c987">checkDistanceFromNodes</a></div><div class="ttdeci">bool checkDistanceFromNodes(struct Poly &amp;poly, IntPoints &amp;intPts, double minDist, Stats &amp;pstats)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01022">computationalGeometry.cpp:1022</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a4016983189eb7ed8e227b49477018d8a"><div class="ttname"><a href="computational_geometry_8cpp.html#a4016983189eb7ed8e227b49477018d8a">checkBoundingBox</a></div><div class="ttdeci">bool checkBoundingBox(Poly &amp;poly1, Poly &amp;poly2)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00379">computationalGeometry.cpp:379</a></div></div>
<div class="ttc" id="cluster_groups_8cpp_html_aa67c48c94718510ec7bd5590f09d090c"><div class="ttname"><a href="cluster_groups_8cpp.html#aa67c48c94718510ec7bd5590f09d090c">updateGroups</a></div><div class="ttdeci">void updateGroups(Poly &amp;newPoly, std::vector&lt; Poly &gt; &amp;acceptedPoly, std::vector&lt; unsigned int &gt; &amp;encounteredGroups, Stats &amp;pstats, int newPolyIndex)</div><div class="ttdef"><b>Definition:</b> <a href="cluster_groups_8cpp_source.html#l00192">clusterGroups.cpp:192</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a7770747ef4153bfb4ae5d53dce0d5876"><div class="ttname"><a href="computational_geometry_8cpp.html#a7770747ef4153bfb4ae5d53dce0d5876">FRAM</a></div><div class="ttdeci">int FRAM(IntPoints &amp;intPts, unsigned int count, std::vector&lt; IntPoints &gt; &amp;intPtsList, Poly &amp;newPoly, Poly &amp;poly2, Stats &amp;pstats, std::vector&lt; TriplePtTempData &gt; &amp;tempData, std::vector&lt; Point &gt; &amp;triplePoints, std::vector&lt; IntPoints &gt; &amp;tempIntPts)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00607">computationalGeometry.cpp:607</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a9eb32a7555c136fb7960f9f13db70004"><div class="ttname"><a href="computational_geometry_8cpp.html#a9eb32a7555c136fb7960f9f13db70004">lineIntersection3D</a></div><div class="ttdeci">Point lineIntersection3D(const double *p1, double *v1, const double *p2, double *v2)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01302">computationalGeometry.cpp:1302</a></div></div>
<div class="ttc" id="struct_stats_html_a5cd7cf21a73c6d359b63732ef1d7eebb"><div class="ttname"><a href="struct_stats.html#a5cd7cf21a73c6d359b63732ef1d7eebb">Stats::discardedLength</a></div><div class="ttdeci">double discardedLength</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00352">structures.h:352</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_adf34efb0050985566dfb41f51967680f"><div class="ttname"><a href="computational_geometry_8cpp.html#adf34efb0050985566dfb41f51967680f">checkCloseEdge</a></div><div class="ttdeci">bool checkCloseEdge(Poly &amp;poly1, IntPoints &amp;intPts, double shrinkLimit, Stats &amp;pstats)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01197">computationalGeometry.cpp:1197</a></div></div>
<div class="ttc" id="struct_point_html_ab99c56589bc8ad5fa5071387110a5bc7"><div class="ttname"><a href="struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">Point::x</a></div><div class="ttdeci">double x</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00112">structures.h:112</a></div></div>
<div class="ttc" id="struct_int_points_html_a7649f6977183bec28e82f383df5c3df9"><div class="ttname"><a href="struct_int_points.html#a7649f6977183bec28e82f383df5c3df9">IntPoints::fract1</a></div><div class="ttdeci">long int fract1</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00135">structures.h:135</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a5e3e0a14f3ad58c314ce2e6a29b03fa2"><div class="ttname"><a href="computational_geometry_8cpp.html#a5e3e0a14f3ad58c314ce2e6a29b03fa2">pointToLineSeg</a></div><div class="ttdeci">double pointToLineSeg(const double *point, const double *line)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01054">computationalGeometry.cpp:1054</a></div></div>
<div class="ttc" id="generating_points_8h_html"><div class="ttname"><a href="generating_points_8h.html">generatingPoints.h</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_af7f1ba8a57908229078780a2695e4e46"><div class="ttname"><a href="computational_geometry_8cpp.html#af7f1ba8a57908229078780a2695e4e46">applyRotation3D</a></div><div class="ttdeci">void applyRotation3D(Poly &amp;newPoly, double *normalB)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00147">computationalGeometry.cpp:147</a></div></div>
<div class="ttc" id="math_functions_8cpp_html_a31921fcb145e36a988b2fca62c737815"><div class="ttname"><a href="math_functions_8cpp.html#a31921fcb145e36a988b2fca62c737815">maxElmtIdx</a></div><div class="ttdeci">int maxElmtIdx(double *v, int n)</div><div class="ttdef"><b>Definition:</b> <a href="math_functions_8cpp_source.html#l00068">mathFunctions.cpp:68</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a68c9aa4c8a1d635c5a662c94722bd19f"><div class="ttname"><a href="computational_geometry_8cpp.html#a68c9aa4c8a1d635c5a662c94722bd19f">printBoundingBox</a></div><div class="ttdeci">void printBoundingBox(struct Poly &amp;newPoly)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00365">computationalGeometry.cpp:365</a></div></div>
<div class="ttc" id="vector_functions_8cpp_html_a3c2b95a1658779bf4d2b104fa9513e75"><div class="ttname"><a href="vector_functions_8cpp.html#a3c2b95a1658779bf4d2b104fa9513e75">projection</a></div><div class="ttdeci">double * projection(const double *v1, const double *v2)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8cpp_source.html#l00020">vectorFunctions.cpp:20</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a237899188f8ca6cf74a2da890cd13868"><div class="ttname"><a href="computational_geometry_8cpp.html#a237899188f8ca6cf74a2da890cd13868">checkForTripleIntersections</a></div><div class="ttdeci">int checkForTripleIntersections(IntPoints &amp;intPts, unsigned int count, std::vector&lt; IntPoints &gt; &amp;intPtsList, Poly &amp;newPoly, Poly &amp;poly2, std::vector&lt; TriplePtTempData &gt; &amp;tempData, std::vector&lt; Point &gt; &amp;triplePoints)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01412">computationalGeometry.cpp:1412</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="input_8h_html_aa0b6ecd1182eec9769b157aa8387e32c"><div class="ttname"><a href="input_8h.html#aa0b6ecd1182eec9769b157aa8387e32c">tripleIntersections</a></div><div class="ttdeci">bool tripleIntersections</div><div class="ttdef"><b>Definition:</b> <a href="read_input_8cpp_source.html#l00041">readInput.cpp:41</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="struct_int_points_html_a0db8df7a80edca81a69597a33d2e56ab"><div class="ttname"><a href="struct_int_points.html#a0db8df7a80edca81a69597a33d2e56ab">IntPoints::triplePointsIdx</a></div><div class="ttdeci">std::vector&lt; unsigned int &gt; triplePointsIdx</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00154">structures.h:154</a></div></div>
<div class="ttc" id="struct_int_points_html"><div class="ttname"><a href="struct_int_points.html">IntPoints</a></div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00132">structures.h:132</a></div></div>
<div class="ttc" id="struct_int_points_html_a327ea7de5bfa98095a81d4c5709b5859"><div class="ttname"><a href="struct_int_points.html#a327ea7de5bfa98095a81d4c5709b5859">IntPoints::x1</a></div><div class="ttdeci">double x1</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00142">structures.h:142</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_ace23b489a120bc6d6407f7e08e1e009d"><div class="ttname"><a href="computational_geometry_8cpp.html#ace23b489a120bc6d6407f7e08e1e009d">createBoundingBox</a></div><div class="ttdeci">void createBoundingBox(struct Poly &amp;newPoly)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00322">computationalGeometry.cpp:322</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_ac1228db3b0fb85b1a5233b1fb78edd4a"><div class="ttname"><a href="computational_geometry_8cpp.html#ac1228db3b0fb85b1a5233b1fb78edd4a">checkDistToOldIntersections</a></div><div class="ttdeci">bool checkDistToOldIntersections(std::vector&lt; IntPoints &gt; &amp;intPtsList, IntPoints &amp;intPts, Poly &amp;poly2, double minDistance)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00680">computationalGeometry.cpp:680</a></div></div>
<div class="ttc" id="struct_point_html_a05ba3b1dfcb19430582ae953cbbfbded"><div class="ttname"><a href="struct_point.html#a05ba3b1dfcb19430582ae953cbbfbded">Point::z</a></div><div class="ttdeci">double z</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00114">structures.h:114</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_acc7b1a87dc0b49ffcb9898dae4cc4e96"><div class="ttname"><a href="computational_geometry_8cpp.html#acc7b1a87dc0b49ffcb9898dae4cc4e96">findIntersections</a></div><div class="ttdeci">struct IntPoints findIntersections(short &amp;flag, Poly &amp;poly1, Poly &amp;poly2)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00399">computationalGeometry.cpp:399</a></div></div>
<div class="ttc" id="testing_8h_html"><div class="ttname"><a href="testing_8h.html">testing.h</a></div></div>
<div class="ttc" id="struct_stats_html"><div class="ttname"><a href="struct_stats.html">Stats</a></div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00277">structures.h:277</a></div></div>
<div class="ttc" id="struct_triple_pt_temp_data_html_a3b5a4de3b697c9e081335d69b67dd64f"><div class="ttname"><a href="struct_triple_pt_temp_data.html#a3b5a4de3b697c9e081335d69b67dd64f">TriplePtTempData::triplePoint</a></div><div class="ttdeci">Point triplePoint</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00183">structures.h:183</a></div></div>
<div class="ttc" id="struct_poly_html_aa6c373c49a4e0ab7c83a353a9f8cf518"><div class="ttname"><a href="struct_poly.html#aa6c373c49a4e0ab7c83a353a9f8cf518">Poly::intersectionIndex</a></div><div class="ttdeci">std::vector&lt; unsigned int &gt; intersectionIndex</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00098">structures.h:98</a></div></div>
<div class="ttc" id="struct_poly_html_a4b92c8fd93db07ccb928298defab1651"><div class="ttname"><a href="struct_poly.html#a4b92c8fd93db07ccb928298defab1651">Poly::normal</a></div><div class="ttdeci">double normal[3]</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00055">structures.h:55</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a545f45434dcbd126c6ff994b9ec2588b"><div class="ttname"><a href="computational_geometry_8cpp.html#a545f45434dcbd126c6ff994b9ec2588b">lineSegToLineSegSep</a></div><div class="ttdeci">double lineSegToLineSegSep(const double *line1, const double *line2)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l01389">computationalGeometry.cpp:1389</a></div></div>
<div class="ttc" id="vector_functions_8h_html_ad5177d4868472616bd9fac80a8b65f78"><div class="ttname"><a href="vector_functions_8h.html#ad5177d4868472616bd9fac80a8b65f78">sqrMagnitude</a></div><div class="ttdeci">T sqrMagnitude(T x, T y, T z)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00098">vectorFunctions.h:98</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a38a8c322dba7d8518a4c3206cd55a5f6"><div class="ttname"><a href="computational_geometry_8cpp.html#a38a8c322dba7d8518a4c3206cd55a5f6">intersectionChecking</a></div><div class="ttdeci">int intersectionChecking(struct Poly &amp;newPoly, std::vector&lt; Poly &gt; &amp;acceptedPoly, std::vector&lt; IntPoints &gt; &amp;intPtsList, struct Stats &amp;pstats, std::vector&lt; Point &gt; &amp;triplePoints)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00870">computationalGeometry.cpp:870</a></div></div>
<div class="ttc" id="struct_int_points_html_a5a3f21b54443313c41a69a05c043cefd"><div class="ttname"><a href="struct_int_points.html#a5a3f21b54443313c41a69a05c043cefd">IntPoints::intersectionShortened</a></div><div class="ttdeci">bool intersectionShortened</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00158">structures.h:158</a></div></div>
<div class="ttc" id="struct_int_points_html_a817f8fb171be24d7383ba0a404192f88"><div class="ttname"><a href="struct_int_points.html#a817f8fb171be24d7383ba0a404192f88">IntPoints::fract2</a></div><div class="ttdeci">long int fract2</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00139">structures.h:139</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a69f93a65c39c49d1b705fad32f790e98"><div class="ttname"><a href="computational_geometry_8cpp.html#a69f93a65c39c49d1b705fad32f790e98">shrinkIntersection</a></div><div class="ttdeci">bool shrinkIntersection(IntPoints &amp;intPts, double *edge, double shrinkLimit, double firstNodeMinDist, double minDist)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00770">computationalGeometry.cpp:770</a></div></div>
<div class="ttc" id="generating_points_8cpp_html_a1765372f6dbad65b4d7cac36d830bdfe"><div class="ttname"><a href="generating_points_8cpp.html#a1765372f6dbad65b4d7cac36d830bdfe">lineFunction3D</a></div><div class="ttdeci">Point lineFunction3D(double *v, double *point, double t)</div><div class="ttdef"><b>Definition:</b> <a href="generating_points_8cpp_source.html#l00072">generatingPoints.cpp:72</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="input_8h_html_a0071fcf088e13e14d3cfa0c15e33e363"><div class="ttname"><a href="input_8h.html#a0071fcf088e13e14d3cfa0c15e33e363">disableFram</a></div><div class="ttdeci">bool disableFram</div><div class="ttdef"><b>Definition:</b> <a href="read_input_8cpp_source.html#l00030">readInput.cpp:30</a></div></div>
<div class="ttc" id="vector_functions_8h_html_a94303b1c8dd36d71e57fd0e4d5d26ae3"><div class="ttname"><a href="vector_functions_8h.html#a94303b1c8dd36d71e57fd0e4d5d26ae3">crossProduct</a></div><div class="ttdeci">T * crossProduct(const T *v1, const T *v2)</div><div class="ttdef"><b>Definition:</b> <a href="vector_functions_8h_source.html#l00024">vectorFunctions.h:24</a></div></div>
<div class="ttc" id="struct_triple_pt_temp_data_html_ac16d38da02334b609c846cd86fcef6f0"><div class="ttname"><a href="struct_triple_pt_temp_data.html#ac16d38da02334b609c846cd86fcef6f0">TriplePtTempData::intIndex</a></div><div class="ttdeci">std::vector&lt; int &gt; intIndex</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00186">structures.h:186</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a878eeb1b4990cde9d7d12a64f647af4d"><div class="ttname"><a href="computational_geometry_8cpp.html#a878eeb1b4990cde9d7d12a64f647af4d">applyRotation2D</a></div><div class="ttdeci">void applyRotation2D(Poly &amp;newPoly, float angle)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00024">computationalGeometry.cpp:24</a></div></div>
<div class="ttc" id="cluster_groups_8h_html"><div class="ttname"><a href="cluster_groups_8h.html">clusterGroups.h</a></div></div>
<div class="ttc" id="struct_triple_pt_temp_data_html"><div class="ttname"><a href="struct_triple_pt_temp_data.html">TriplePtTempData</a></div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00181">structures.h:181</a></div></div>
<div class="ttc" id="math_functions_8cpp_html_a144421162e6b2cc91b275cf0c41488da"><div class="ttname"><a href="math_functions_8cpp.html#a144421162e6b2cc91b275cf0c41488da">sumDevAry3</a></div><div class="ttdeci">double * sumDevAry3(double *v)</div><div class="ttdef"><b>Definition:</b> <a href="math_functions_8cpp_source.html#l00046">mathFunctions.cpp:46</a></div></div>
<div class="ttc" id="struct_poly_html_ac93df10849f4916e195a899d2ba55485"><div class="ttname"><a href="struct_poly.html#ac93df10849f4916e195a899d2ba55485">Poly::translation</a></div><div class="ttdeci">double translation[3]</div><div class="ttdef"><b>Definition:</b> <a href="structures_8h_source.html#l00052">structures.h:52</a></div></div>
<div class="ttc" id="computational_geometry_8cpp_html_a8aaea6ef9d977f6d7d571d45ace1ad5d"><div class="ttname"><a href="computational_geometry_8cpp.html#a8aaea6ef9d977f6d7d571d45ace1ad5d">rotationMatrix</a></div><div class="ttdeci">double * rotationMatrix(double *normalA, double *normalB)</div><div class="ttdef"><b>Definition:</b> <a href="computational_geometry_8cpp_source.html#l00073">computationalGeometry.cpp:73</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="computational_geometry_8cpp.html">computationalGeometry.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>
