<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: AS3 – Creating a Convex Polygon from Unordered Points</title>
	<atom:link href="http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/feed/" rel="self" type="application/rss+xml" />
	<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/</link>
	<description>code. blog.</description>
	<lastBuildDate>Sun, 08 Jan 2012 00:24:04 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.3</generator>
	<item>
		<title>By: Schell</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-2083</link>
		<dc:creator>Schell</dc:creator>
		<pubDate>Sat, 07 Jan 2012 23:51:56 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-2083</guid>
		<description>Feonyx - Meaning they have the same angle with respect to the corner point? If that&#039;s the case, the point that gets picked *should* be whichever one is furthest from the corner point...is this what is happening?</description>
		<content:encoded><![CDATA[<p>Feonyx &#8211; Meaning they have the same angle with respect to the corner point? If that&#8217;s the case, the point that gets picked *should* be whichever one is furthest from the corner point&#8230;is this what is happening?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Feonyx</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-2078</link>
		<dc:creator>Feonyx</dc:creator>
		<pubDate>Fri, 09 Dec 2011 23:50:59 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-2078</guid>
		<description>One problem I ran into using this code is when some of those points have the same angle. Do you have a solution for the following coords:
(x=0, y=0),(x=510, y=0),(x=510, y=419),(x=0, y=419),(x=0, y=423),(x=168, y=423),(x=168, y=538),(x=0, y=538)</description>
		<content:encoded><![CDATA[<p>One problem I ran into using this code is when some of those points have the same angle. Do you have a solution for the following coords:<br />
(x=0, y=0),(x=510, y=0),(x=510, y=419),(x=0, y=419),(x=0, y=423),(x=168, y=423),(x=168, y=538),(x=0, y=538)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-1982</link>
		<dc:creator>Michael</dc:creator>
		<pubDate>Wed, 09 Feb 2011 06:51:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-1982</guid>
		<description>Hi Schell, you really saved my day ;) Now I just need to draw a smooth curved outline around those points. Thanks a lot for sharing this peace of code!!</description>
		<content:encoded><![CDATA[<p>Hi Schell, you really saved my day <img src='http://efnx.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' />  Now I just need to draw a smooth curved outline around those points. Thanks a lot for sharing this peace of code!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Schell</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-1819</link>
		<dc:creator>Schell</dc:creator>
		<pubDate>Mon, 08 Nov 2010 18:27:01 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-1819</guid>
		<description>No prob, I&#039;m glad it worked.</description>
		<content:encoded><![CDATA[<p>No prob, I&#8217;m glad it worked.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ricky</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-1786</link>
		<dc:creator>Ricky</dc:creator>
		<pubDate>Sat, 30 Oct 2010 09:50:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-1786</guid>
		<description>Me too! Wow - typed in &#039;forming a convex polygon from unordered points&#039; came straight here, and got it working on AS3 in 2 mins. Thanks so much Schell! Really appreciate it.</description>
		<content:encoded><![CDATA[<p>Me too! Wow &#8211; typed in &#8216;forming a convex polygon from unordered points&#8217; came straight here, and got it working on AS3 in 2 mins. Thanks so much Schell! Really appreciate it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: vanni</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-802</link>
		<dc:creator>vanni</dc:creator>
		<pubDate>Sun, 20 Jun 2010 12:09:29 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-802</guid>
		<description>Nice script! i was searching exactly this one!!</description>
		<content:encoded><![CDATA[<p>Nice script! i was searching exactly this one!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Schell</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-764</link>
		<dc:creator>Schell</dc:creator>
		<pubDate>Wed, 21 Apr 2010 01:15:48 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-764</guid>
		<description>Ah, yes thanks! Must have been an artifact from flash&#039;s flipped cartesian coordinates, since in this case we only want left hand turns, not right hand, nor collinear.</description>
		<content:encoded><![CDATA[<p>Ah, yes thanks! Must have been an artifact from flash&#8217;s flipped cartesian coordinates, since in this case we only want left hand turns, not right hand, nor collinear.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kevin Tanadi</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-762</link>
		<dc:creator>Kevin Tanadi</dc:creator>
		<pubDate>Mon, 19 Apr 2010 04:33:23 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-762</guid>
		<description>In the code : &quot;while(direction(hull[hull.length - 2], hull[hull.length - 1], data[i]) &gt; 0)&quot;
it should be &quot;while(direction(hull[hull.length - 2], hull[hull.length - 1], data[i]) &gt;= 0)&quot;

because if there are two nodes with same position (same x, and y), it will still be included in the result..</description>
		<content:encoded><![CDATA[<p>In the code : &#8220;while(direction(hull[hull.length - 2], hull[hull.length - 1], data[i]) &gt; 0)&#8221;<br />
it should be &#8220;while(direction(hull[hull.length - 2], hull[hull.length - 1], data[i]) &gt;= 0)&#8221;</p>
<p>because if there are two nodes with same position (same x, and y), it will still be included in the result..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bobby</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-740</link>
		<dc:creator>bobby</dc:creator>
		<pubDate>Tue, 23 Feb 2010 18:24:04 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-740</guid>
		<description>You cannot believe how long ive been searching for something like this. Scrolled through 8 pages of Google results and couldn&#039;t find anything. Very first page on Bing. There this is... Gotta start using this more often</description>
		<content:encoded><![CDATA[<p>You cannot believe how long ive been searching for something like this. Scrolled through 8 pages of Google results and couldn&#8217;t find anything. Very first page on Bing. There this is&#8230; Gotta start using this more often</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Box2D mouse drawing &#171; Splashdust.net</title>
		<link>http://efnx.com/as3-creating-a-convex-polygon-from-unordered-points/comment-page-1/#comment-597</link>
		<dc:creator>Box2D mouse drawing &#171; Splashdust.net</dc:creator>
		<pubDate>Tue, 20 Oct 2009 19:34:05 +0000</pubDate>
		<guid isPermaLink="false">http://blog.efnx.com/?p=215#comment-597</guid>
		<description>[...] Regarding the problem of concave polys and vertex limits I found a great AS3 class for polygon triangulation over here: http://actionsnippet.com/?p=1462 That class takes a polygon and spits out a bunch of triangles, which when put together assumes the same hull shape as the original polygon. This solved a lot of my problems. However, triangulation does not work when there are overlapping segments in the polygon, which might easily be the case when one jots a bunch of lines on the screen in no particular order. So I needed something to make order from that kind of mess. What I found was the Graham scan algorithm, neatly converted to AS3 at http://blog.efnx.com/as3-creating-a-convex-polygon-from-unordered-points/ [...]</description>
		<content:encoded><![CDATA[<p>[...] Regarding the problem of concave polys and vertex limits I found a great AS3 class for polygon triangulation over here: <a href="http://actionsnippet.com/?p=1462" rel="nofollow">http://actionsnippet.com/?p=1462</a> That class takes a polygon and spits out a bunch of triangles, which when put together assumes the same hull shape as the original polygon. This solved a lot of my problems. However, triangulation does not work when there are overlapping segments in the polygon, which might easily be the case when one jots a bunch of lines on the screen in no particular order. So I needed something to make order from that kind of mess. What I found was the Graham scan algorithm, neatly converted to AS3 at <a href="http://blog.efnx.com/as3-creating-a-convex-polygon-from-unordered-points/" rel="nofollow">http://blog.efnx.com/as3-creating-a-convex-polygon-from-unordered-points/</a> [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

