<?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: Separating Axis Theorem (SAT) Explanation</title>
	<atom:link href="http://www.sevenson.com.au/actionscript/sat/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.sevenson.com.au/actionscript/sat/</link>
	<description>The online presence of Andrew Sevenson</description>
	<lastBuildDate>Tue, 06 Jul 2010 22:10:33 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: meming</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-310</link>
		<dc:creator>meming</dc:creator>
		<pubDate>Tue, 06 Jul 2010 22:10:33 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-310</guid>
		<description>I totally understand whats going on, its just I dont know how to put this in code, I give this tut a 90% ( which is great ) but if you put a little code under each step, (especially when we create the &quot;axis&quot;) this would get an instant 110%. You wont have to reply to this, ill just spend an hour on google, but future viewers will want the same.</description>
		<content:encoded><![CDATA[<p>I totally understand whats going on, its just I dont know how to put this in code, I give this tut a 90% ( which is great ) but if you put a little code under each step, (especially when we create the &#8220;axis&#8221;) this would get an instant 110%. You wont have to reply to this, ill just spend an hour on google, but future viewers will want the same.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Adam Baker</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-309</link>
		<dc:creator>Adam Baker</dc:creator>
		<pubDate>Thu, 20 May 2010 06:55:17 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-309</guid>
		<description>In fact, now I have some feedback: it would be worth emphasizing more that it&#039;s necessary to use normals from *both* polygons as axes.</description>
		<content:encoded><![CDATA[<p>In fact, now I have some feedback: it would be worth emphasizing more that it&#8217;s necessary to use normals from *both* polygons as axes.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Adam Baker</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-308</link>
		<dc:creator>Adam Baker</dc:creator>
		<pubDate>Wed, 19 May 2010 06:49:03 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-308</guid>
		<description>This is a great explanation, thanks!</description>
		<content:encoded><![CDATA[<p>This is a great explanation, thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew Sevenson</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-303</link>
		<dc:creator>Andrew Sevenson</dc:creator>
		<pubDate>Sat, 27 Mar 2010 11:05:24 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-303</guid>
		<description>Hmm - good question.  Its been a while since I wrote it so I had to have a look at the code again.  
At a quick glance it looks like the vOffset is the vector between two shapes, and the sOffset seems to be a scalar used to calc the projected points of the second shape.  I can&#039;t remember exactly why it is there - my instinct is that it would be to keep the objects in the same coordinate space - but if yours works without it, maybe it isn&#039;t needed :p</description>
		<content:encoded><![CDATA[<p>Hmm &#8211; good question.  Its been a while since I wrote it so I had to have a look at the code again.<br />
At a quick glance it looks like the vOffset is the vector between two shapes, and the sOffset seems to be a scalar used to calc the projected points of the second shape.  I can&#8217;t remember exactly why it is there &#8211; my instinct is that it would be to keep the objects in the same coordinate space &#8211; but if yours works without it, maybe it isn&#8217;t needed :p</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: wwwebber</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-301</link>
		<dc:creator>wwwebber</dc:creator>
		<pubDate>Wed, 24 Mar 2010 09:43:30 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-301</guid>
		<description>Great post...question, I used your code as a basis for my own SAT test..question though--what is the purpose of sOffset and vOffset? Intersection tests in my version, work perfectly, without using either of these.</description>
		<content:encoded><![CDATA[<p>Great post&#8230;question, I used your code as a basis for my own SAT test..question though&#8211;what is the purpose of sOffset and vOffset? Intersection tests in my version, work perfectly, without using either of these.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew Sevenson</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-294</link>
		<dc:creator>Andrew Sevenson</dc:creator>
		<pubDate>Sun, 31 Jan 2010 11:51:01 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-294</guid>
		<description>Ah yes - you are absolutely correct.  I&#039;ve fixed that now - thanks for that :)</description>
		<content:encoded><![CDATA[<p>Ah yes &#8211; you are absolutely correct.  I&#8217;ve fixed that now &#8211; thanks for that <img src='http://www.sevenson.com.au/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vanderful</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-293</link>
		<dc:creator>Vanderful</dc:creator>
		<pubDate>Sun, 31 Jan 2010 11:38:36 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-293</guid>
		<description>Great tuto !

Just some details:
In your first sentence you talk about concave polygons instead of convex ones.
The axis to be kept is the one which has the minimal overlap (not the greatest).

Anyway, really nice work !</description>
		<content:encoded><![CDATA[<p>Great tuto !</p>
<p>Just some details:<br />
In your first sentence you talk about concave polygons instead of convex ones.<br />
The axis to be kept is the one which has the minimal overlap (not the greatest).</p>
<p>Anyway, really nice work !</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrew Sevenson</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-292</link>
		<dc:creator>Andrew Sevenson</dc:creator>
		<pubDate>Sun, 31 Jan 2010 01:51:12 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-292</guid>
		<description>Hi Will,

I had a quick look at the implementation you posted.  It appears to be checking for a collision only, and not actually figuring out how to separate them.  If you were to use the &#039;axis&#039; property directly after that method you would always get the last axis that was tested, which is not necessarily the the shortest path of separation.

To get the right axis, you would have to keep track of which axis had the shortest amount of overlap.  This should be as simple as having another vector variable declared and checking it each time an axis is tested.  If you get to the end and there is a collision, simply use the vector you have stored for the separation.

At least, that is how my code works. 

Hope that helps</description>
		<content:encoded><![CDATA[<p>Hi Will,</p>
<p>I had a quick look at the implementation you posted.  It appears to be checking for a collision only, and not actually figuring out how to separate them.  If you were to use the &#8216;axis&#8217; property directly after that method you would always get the last axis that was tested, which is not necessarily the the shortest path of separation.</p>
<p>To get the right axis, you would have to keep track of which axis had the shortest amount of overlap.  This should be as simple as having another vector variable declared and checking it each time an axis is tested.  If you get to the end and there is a collision, simply use the vector you have stored for the separation.</p>
<p>At least, that is how my code works. </p>
<p>Hope that helps</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Will</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-291</link>
		<dc:creator>Will</dc:creator>
		<pubDate>Sat, 30 Jan 2010 06:09:59 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-291</guid>
		<description>The problem seems to be that the axis given for separation is the wrong one, any help?</description>
		<content:encoded><![CDATA[<p>The problem seems to be that the axis given for separation is the wrong one, any help?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Will</title>
		<link>http://www.sevenson.com.au/actionscript/sat/comment-page-1/#comment-290</link>
		<dc:creator>Will</dc:creator>
		<pubDate>Sat, 30 Jan 2010 01:22:29 +0000</pubDate>
		<guid isPermaLink="false">http://127.0.0.1/wordpress/?p=196#comment-290</guid>
		<description>I&#039;m writing an implementation of this, and I can&#039;t figure out how to find the vector that separates the shapes (called collisionInfo.separation in your implementation). Having just read through your version, trying to write your way of finding it, and watching my two shapes fly right through each other, I was wondering if you could provide some light on this topic.

BTW the original implementation that I based mine upon could be found &lt;a href=&quot;http://gpwiki.org/index.php/Physics:2D_Physics_Engine:Intersection_Detection&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt; (if you could put how it works in the wiki, that&#039;d be awesome :) )</description>
		<content:encoded><![CDATA[<p>I&#8217;m writing an implementation of this, and I can&#8217;t figure out how to find the vector that separates the shapes (called collisionInfo.separation in your implementation). Having just read through your version, trying to write your way of finding it, and watching my two shapes fly right through each other, I was wondering if you could provide some light on this topic.</p>
<p>BTW the original implementation that I based mine upon could be found <a href="http://gpwiki.org/index.php/Physics:2D_Physics_Engine:Intersection_Detection" rel="nofollow">here</a> (if you could put how it works in the wiki, that&#8217;d be awesome <img src='http://www.sevenson.com.au/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  )</p>
]]></content:encoded>
	</item>
</channel>
</rss>
