creyD/intelliphoto
1
0
Fork 0
mirror of https://github.com/creyD/intelliphoto.git synced 2026-04-16 13:20:33 +02:00
Code Issues Packages Projects Releases Wiki Activity

Automated Release Preparation

Browse Source
This commit is contained in:
Jan Schuffenhauer
2020-01-16 12:52:25 +01:00
parent d60796ccae
commit b055c0b922
90 changed files with 722 additions and 741 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
docs/html/_intelli_triangulation_8h.html
View File

@@ -117,9 +117,9 @@ Functions</h2></td></tr>
<tr class="memitem:acdaf1ed598e868b25e9e06d580da32e5"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="struct_triangle.html">Triangle</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespace_intelli_triangulation.html#acdaf1ed598e868b25e9e06d580da32e5">IntelliTriangulation::calculateTriangles</a> (std::vector&lt; QPoint &gt; polyPoints)</td></tr>
<tr class="memdesc:acdaf1ed598e868b25e9e06d580da32e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to split a polygon in its spanning traingles by using Meisters Theorem of graph theory by clipping ears of a planar graph. <a href="namespace_intelli_triangulation.html#acdaf1ed598e868b25e9e06d580da32e5">More...</a><br /></td></tr>
<tr class="separator:acdaf1ed598e868b25e9e06d580da32e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a00621e2d8708fe2e8966d7d79b64e186"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespace_intelli_triangulation.html#a00621e2d8708fe2e8966d7d79b64e186">IntelliTriangulation::isInPolygon</a> (std::vector&lt; <a class="el" href="struct_triangle.html">Triangle</a> &gt; &amp;triangles, QPoint &amp;point)</td></tr>
<tr class="memdesc:a00621e2d8708fe2e8966d7d79b64e186"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to check if a point lies in a polygon by checking its spanning triangles. <a href="namespace_intelli_triangulation.html#a00621e2d8708fe2e8966d7d79b64e186">More...</a><br /></td></tr>
<tr class="separator:a00621e2d8708fe2e8966d7d79b64e186"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac276696f29d141ed34614c1c3b1c040f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespace_intelli_triangulation.html#ac276696f29d141ed34614c1c3b1c040f">IntelliTriangulation::isInPolygon</a> (const std::vector&lt; <a class="el" href="struct_triangle.html">Triangle</a> &gt; &amp;triangles, QPoint &amp;point)</td></tr>
<tr class="memdesc:ac276696f29d141ed34614c1c3b1c040f"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to check if a point lies in a polygon by checking its spanning triangles. <a href="namespace_intelli_triangulation.html#ac276696f29d141ed34614c1c3b1c040f">More...</a><br /></td></tr>
<tr class="separator:ac276696f29d141ed34614c1c3b1c040f"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->