<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[konkav in konvex?]]></title><description><![CDATA[<p>Gibt es ein Verfahren, einen beliebig konkaves Polygon in konvexe Polygone zu zerlegen?</p>
<p>Vielen Dank!</p>
]]></description><link>https://www.c-plusplus.net/forum/topic/185565/konkav-in-konvex</link><generator>RSS for Node</generator><lastBuildDate>Wed, 01 Jul 2026 23:57:53 GMT</lastBuildDate><atom:link href="https://www.c-plusplus.net/forum/topic/185565.rss" rel="self" type="application/rss+xml"/><pubDate>Wed, 27 Jun 2007 00:08:25 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to konkav in konvex? on Wed, 27 Jun 2007 00:08:25 GMT]]></title><description><![CDATA[<p>Gibt es ein Verfahren, einen beliebig konkaves Polygon in konvexe Polygone zu zerlegen?</p>
<p>Vielen Dank!</p>
]]></description><link>https://www.c-plusplus.net/forum/post/1314429</link><guid isPermaLink="true">https://www.c-plusplus.net/forum/post/1314429</guid><dc:creator><![CDATA[-Thomas-]]></dc:creator><pubDate>Wed, 27 Jun 2007 00:08:25 GMT</pubDate></item><item><title><![CDATA[Reply to konkav in konvex? on Wed, 27 Jun 2007 04:25:05 GMT]]></title><description><![CDATA[<p>-Thomas- schrieb:</p>
<blockquote>
<p>Gibt es ein Verfahren, einen beliebig konkaves Polygon in konvexe Polygone zu zerlegen?</p>
</blockquote>
<p>Ja.</p>
<blockquote>
<p>Vielen Dank!</p>
</blockquote>
<p>Gern geschehen.</p>
]]></description><link>https://www.c-plusplus.net/forum/post/1314442</link><guid isPermaLink="true">https://www.c-plusplus.net/forum/post/1314442</guid><dc:creator><![CDATA[MFK]]></dc:creator><pubDate>Wed, 27 Jun 2007 04:25:05 GMT</pubDate></item><item><title><![CDATA[Reply to konkav in konvex? on Wed, 27 Jun 2007 08:50:15 GMT]]></title><description><![CDATA[<p>-Thomas- schrieb:</p>
<blockquote>
<p>Gibt es ein Verfahren, einen beliebig konkaves Polygon in konvexe Polygone zu zerlegen?</p>
</blockquote>
<p>Eines dieser Verfahren heißt Triangulation. <img
      src="https://www.c-plusplus.net/forum/plugins/nodebb-plugin-emoji/emoji/emoji-one/1f609.png?v=ab1pehoraso"
      class="not-responsive emoji emoji-emoji-one emoji--winking_face"
      title=";)"
      alt="😉"
    /></p>
]]></description><link>https://www.c-plusplus.net/forum/post/1314562</link><guid isPermaLink="true">https://www.c-plusplus.net/forum/post/1314562</guid><dc:creator><![CDATA[Jester]]></dc:creator><pubDate>Wed, 27 Jun 2007 08:50:15 GMT</pubDate></item><item><title><![CDATA[Reply to konkav in konvex? on Sat, 30 Jun 2007 13:27:42 GMT]]></title><description><![CDATA[<p><a class="plugin-mentions-user plugin-mentions-a" href="https://www.c-plusplus.net/forum/uid/2803">@MFK</a><br />
Gibt es einen effizenteren Algorithmus als das besagten Triangulation Verfahren?</p>
<p>@all<br />
Wie heißen diese?</p>
<p>LG</p>
]]></description><link>https://www.c-plusplus.net/forum/post/1315640</link><guid isPermaLink="true">https://www.c-plusplus.net/forum/post/1315640</guid><dc:creator><![CDATA[-Thomas-]]></dc:creator><pubDate>Sat, 30 Jun 2007 13:27:42 GMT</pubDate></item></channel></rss>