<?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: Pseudo 2D Convex Hull Generation</title>
	<atom:link href="http://karnbianco.co.uk/blog/2009/08/18/pseudo-2d-convex-hull-generation/feed/" rel="self" type="application/rss+xml" />
	<link>http://karnbianco.co.uk/blog/2009/08/18/pseudo-2d-convex-hull-generation/</link>
	<description>Karn Spydar Lee Bianco &#124; Game Programmer, Freelance Writer</description>
	<lastBuildDate>Wed, 09 May 2012 12:50:24 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Karn Bianco</title>
		<link>http://karnbianco.co.uk/blog/2009/08/18/pseudo-2d-convex-hull-generation/#comment-413</link>
		<dc:creator>Karn Bianco</dc:creator>
		<pubDate>Wed, 20 Oct 2010 20:22:21 +0000</pubDate>
		<guid isPermaLink="false">http://karnbianco.com/blog/?p=191#comment-413</guid>
		<description>Ah, nice one - hadn&#039;t thought of that. Thanks for the comment!</description>
		<content:encoded><![CDATA[<p>Ah, nice one &#8211; hadn&#8217;t thought of that. Thanks for the comment!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Graeme Pollard</title>
		<link>http://karnbianco.co.uk/blog/2009/08/18/pseudo-2d-convex-hull-generation/#comment-412</link>
		<dc:creator>Graeme Pollard</dc:creator>
		<pubDate>Wed, 20 Oct 2010 14:06:14 +0000</pubDate>
		<guid isPermaLink="false">http://karnbianco.com/blog/?p=191#comment-412</guid>
		<description>I know this is really old Karn, but I remember you posting on one of my blogs yonks ago, so thought I&#039;d post. Anyway, it&#039;s pretty easy to check if the points are actually convex. By definition, all of the inner angles of a convex shape are less than 180 degrees. And that&#039;s really easy to check for each point by getting the angle between the 2 vectors between the point and the point either side of it. If one of them fails this convex criteria you can just ignore it. Anyway, cool stuff.</description>
		<content:encoded><![CDATA[<p>I know this is really old Karn, but I remember you posting on one of my blogs yonks ago, so thought I&#8217;d post. Anyway, it&#8217;s pretty easy to check if the points are actually convex. By definition, all of the inner angles of a convex shape are less than 180 degrees. And that&#8217;s really easy to check for each point by getting the angle between the 2 vectors between the point and the point either side of it. If one of them fails this convex criteria you can just ignore it. Anyway, cool stuff.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

