mirror of
https://github.com/creyD/intelliphoto.git
synced 2026-04-12 19:40:28 +02:00
234 lines
30 KiB
HTML
234 lines
30 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.17"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>IntelliPhoto: src/IntelliHelper/IntelliTriangulation.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>
|
|
<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">IntelliPhoto
|
|
 <span id="projectnumber">0.7</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.17 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</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">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('_intelli_triangulation_8cpp_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</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">IntelliTriangulation.cpp</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="_intelli_triangulation_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> <span class="preprocessor">#include "<a class="code" href="_intelli_triangulation_8h.html">IntelliTriangulation.h</a>"</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include <cmath></span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"><a class="line" href="_intelli_triangulation_8cpp.html#a1daf785e3f68d293c7caa1c756d5cb74"> 5</a></span> <span class="preprocessor">#define pi 3.1415926535897932384626433832795</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>  </div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"><a class="line" href="namespace_intelli_triangulation.html#acdaf1ed598e868b25e9e06d580da32e5"> 7</a></span> std::vector<Triangle> <a class="code" href="namespace_intelli_triangulation.html#acdaf1ed598e868b25e9e06d580da32e5">IntelliTriangulation::calculateTriangles</a>(std::vector<QPoint> polyPoints){</div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>  <span class="comment">// helper for managing the triangle vertices and their state</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>  <span class="keyword">struct </span>TriangleHelper {</div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>  QPoint vertex;</div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>  <span class="keywordtype">float</span> interiorAngle;</div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  <span class="keywordtype">int</span> idx;</div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  <span class="keywordtype">bool</span> isTip;</div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  };</div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  <span class="comment">// calculates the inner angle of 'point'</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  <span class="keyword">auto</span> calculateInner = [] (QPoint& point, QPoint& prev, QPoint& post) {</div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  QPoint AP(point.x() - prev.x(), point.y() - prev.y());</div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  QPoint BP(point.x() - post.x(), point.y() - post.y());</div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  <span class="keywordtype">float</span> topSclar = AP.x() * BP.x() + AP.y() * BP.y();</div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keywordtype">float</span> absolute = <span class="keyword">static_cast<</span><span class="keywordtype">float</span><span class="keyword">></span>(sqrt(pow(AP.x(),2.) + pow(AP.y(),2.)) * sqrt(pow(BP.x(),2.) + pow(BP.y(),2.)));</div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keywordflow">return</span> acos(topSclar / absolute);</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  };</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="comment">// gets the first element of vec for which element.isTip == true holds</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">auto</span> getTip = [] (<span class="keyword">const</span> std::vector<TriangleHelper>& vec) {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keywordtype">size_t</span> min = 0;</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0; i<vec.size(); i++) {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">if</span>(vec[i].interiorAngle<vec[min].interiorAngle) {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  min = i;</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  }</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  }</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">return</span> vec[min];</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  };</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  </div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// get the vertex idx bevor idx in relation to the container length</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">auto</span> getPrev = [] (<span class="keywordtype">int</span> idx, <span class="keywordtype">int</span> length) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> (idx - 1)>=0 ? (idx - 1) : (length - 1);</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  };</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// get the vertex idx after idx in relation to the container lenght</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keyword">auto</span> getPost = [] (<span class="keywordtype">int</span> idx, <span class="keywordtype">int</span> length) {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">return</span> (idx + 1) % length;</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  };</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// return if the vertex is a tip</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">auto</span> isTip = [] (<span class="keywordtype">float</span> angle) {</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(angle)<(<a class="code" href="_intelli_triangulation_8cpp.html#a1daf785e3f68d293c7caa1c756d5cb74">pi</a> / 2.);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  };</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  std::vector<TriangleHelper> Vertices;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  std::vector<Triangle> Triangles;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// set up all vertices and calculate intirior angle</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i<static_cast<int>(polyPoints.size()); i++) {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  TriangleHelper helper;</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordtype">int</span> prev = getPrev(i, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(polyPoints.size()));</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">int</span> post = getPost(i, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(polyPoints.size()));</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  helper.vertex = polyPoints[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(i)];</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  helper.idx = i;</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  </div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  helper.interiorAngle = calculateInner(polyPoints[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(i)],</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  polyPoints[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)],</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  polyPoints[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)]);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  helper.isTip = isTip(helper.interiorAngle);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Vertices.push_back(helper);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  </div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// search triangles based on the intirior angles of each vertey</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">while</span>(Triangles.size() != polyPoints.size() - 2) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="struct_triangle.html">Triangle</a> tri;</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  TriangleHelper smallest = getTip(Vertices);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">int</span> prev = getPrev(smallest.idx, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">int</span> post = getPost(smallest.idx, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// set triangle and push it</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  tri.<a class="code" href="struct_triangle.html#a4fe8b39e0144ebff908b7718c2f2751b">A</a> = Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)].vertex;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  tri.<a class="code" href="struct_triangle.html#a64fa6a90a6131f12a1a3054bf86647d7">B</a> = Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(smallest.idx)].vertex;</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  tri.<a class="code" href="struct_triangle.html#addb8aaab314d79f3617acca01e12872a">C</a> = Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)].vertex;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  Triangles.push_back(tri);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// update Vertice array</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  Vertices.erase(Vertices.begin() + smallest.idx);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(smallest.idx); i<Vertices.size(); i++) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  Vertices[i].idx -= 1;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// update post und prev idx</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  post = getPrev(post, Vertices.size());</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  prev = prev<smallest.idx ? prev : (prev - 1);</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// calcultae neighboors of prev and post to calculate new interior angles</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">int</span> prevOfPrev = getPrev(prev, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">int</span> postOfPrev = getPost(prev, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">int</span> prevOfPost = getPrev(post, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">int</span> postOfPost = getPost(post, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(Vertices.size()));</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  </div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// update vertices with interior angles</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// updtae prev</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)].interiorAngle = calculateInner(Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)].vertex,</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prevOfPrev)].vertex,</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(postOfPrev)].vertex);</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)].isTip = isTip(Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prev)].interiorAngle);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// update post</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)].interiorAngle = calculateInner(Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)].vertex,</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(prevOfPost)].vertex,</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(postOfPost)].vertex);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)].isTip = isTip(Vertices[<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(post)].interiorAngle);</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">return</span> Triangles;</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"><a class="line" href="namespace_intelli_triangulation.html#ac276696f29d141ed34614c1c3b1c040f"> 116</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespace_intelli_triangulation.html#ac276696f29d141ed34614c1c3b1c040f">IntelliTriangulation::isInPolygon</a>(<span class="keyword">const</span> std::vector<Triangle> &triangles, QPoint &point){</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> triangle : triangles) {</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span>(<a class="code" href="namespace_intelli_triangulation.html#ac150fee67fd41a451bd2592f10e00197">IntelliTriangulation::isInTriangle</a>(triangle, point)) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> }</div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="anamespace_intelli_triangulation_html_ac150fee67fd41a451bd2592f10e00197"><div class="ttname"><a href="namespace_intelli_triangulation.html#ac150fee67fd41a451bd2592f10e00197">IntelliTriangulation::isInTriangle</a></div><div class="ttdeci">bool isInTriangle(Triangle &tri, QPoint &P)</div><div class="ttdoc">A function to check if a given point is in a triangle.</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8h_source.html#l00036">IntelliTriangulation.h:36</a></div></div>
|
|
<div class="ttc" id="anamespace_intelli_triangulation_html_acdaf1ed598e868b25e9e06d580da32e5"><div class="ttname"><a href="namespace_intelli_triangulation.html#acdaf1ed598e868b25e9e06d580da32e5">IntelliTriangulation::calculateTriangles</a></div><div class="ttdeci">std::vector< Triangle > calculateTriangles(std::vector< QPoint > polyPoints)</div><div class="ttdoc">A function to split a polygon in its spanning traingles by using Meisters Theorem of graph theory by ...</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8cpp_source.html#l00007">IntelliTriangulation.cpp:7</a></div></div>
|
|
<div class="ttc" id="astruct_triangle_html_a64fa6a90a6131f12a1a3054bf86647d7"><div class="ttname"><a href="struct_triangle.html#a64fa6a90a6131f12a1a3054bf86647d7">Triangle::B</a></div><div class="ttdeci">QPoint B</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8h_source.html#l00014">IntelliTriangulation.h:14</a></div></div>
|
|
<div class="ttc" id="a_intelli_triangulation_8cpp_html_a1daf785e3f68d293c7caa1c756d5cb74"><div class="ttname"><a href="_intelli_triangulation_8cpp.html#a1daf785e3f68d293c7caa1c756d5cb74">pi</a></div><div class="ttdeci">#define pi</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8cpp_source.html#l00005">IntelliTriangulation.cpp:5</a></div></div>
|
|
<div class="ttc" id="astruct_triangle_html_addb8aaab314d79f3617acca01e12872a"><div class="ttname"><a href="struct_triangle.html#addb8aaab314d79f3617acca01e12872a">Triangle::C</a></div><div class="ttdeci">QPoint C</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8h_source.html#l00014">IntelliTriangulation.h:14</a></div></div>
|
|
<div class="ttc" id="astruct_triangle_html"><div class="ttname"><a href="struct_triangle.html">Triangle</a></div><div class="ttdoc">The Triangle struct holds the 3 vertices of a triangle.</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8h_source.html#l00013">IntelliTriangulation.h:13</a></div></div>
|
|
<div class="ttc" id="astruct_triangle_html_a4fe8b39e0144ebff908b7718c2f2751b"><div class="ttname"><a href="struct_triangle.html#a4fe8b39e0144ebff908b7718c2f2751b">Triangle::A</a></div><div class="ttdeci">QPoint A</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8h_source.html#l00014">IntelliTriangulation.h:14</a></div></div>
|
|
<div class="ttc" id="anamespace_intelli_triangulation_html_ac276696f29d141ed34614c1c3b1c040f"><div class="ttname"><a href="namespace_intelli_triangulation.html#ac276696f29d141ed34614c1c3b1c040f">IntelliTriangulation::isInPolygon</a></div><div class="ttdeci">bool isInPolygon(const std::vector< Triangle > &triangles, QPoint &point)</div><div class="ttdoc">A function to check if a point lies in a polygon by checking its spanning triangles.</div><div class="ttdef"><b>Definition:</b> <a href="_intelli_triangulation_8cpp_source.html#l00116">IntelliTriangulation.cpp:116</a></div></div>
|
|
<div class="ttc" id="a_intelli_triangulation_8h_html"><div class="ttname"><a href="_intelli_triangulation_8h.html">IntelliTriangulation.h</a></div></div>
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_8de6078cba2a961961818cf80b28fd4f.html">IntelliHelper</a></li><li class="navelem"><a class="el" href="_intelli_triangulation_8cpp.html">IntelliTriangulation.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.17 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|