<?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: Code: 2D line intersection</title>
	<atom:link href="http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/feed/" rel="self" type="application/rss+xml" />
	<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/</link>
	<description>Computational aesthetics and programming for artists and designers.</description>
	<lastBuildDate>Wed, 28 Jul 2010 09:54:23 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: marius watz</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-244693</link>
		<dc:creator>marius watz</dc:creator>
		<pubDate>Sun, 04 Jul 2010 01:42:49 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-244693</guid>
		<description>Hi Oito! It looks like the ub calculation is redundant, an oversight on my part.</description>
		<content:encoded><![CDATA[<p>Hi Oito! It looks like the ub calculation is redundant, an oversight on my part.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oito</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-243979</link>
		<dc:creator>oito</dc:creator>
		<pubDate>Thu, 01 Jul 2010 08:07:07 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-243979</guid>
		<description>Hi,

thanks for the code. What are you calculating ub for?</description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>thanks for the code. What are you calculating ub for?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: miska</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-232650</link>
		<dc:creator>miska</dc:creator>
		<pubDate>Thu, 29 Apr 2010 07:27:37 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-232650</guid>
		<description>aha! just what I&#039;ve always wanted but didn&#039;t know where to find :) 

many thanks!</description>
		<content:encoded><![CDATA[<p>aha! just what I&#8217;ve always wanted but didn&#8217;t know where to find <img src='http://workshop.evolutionzone.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  </p>
<p>many thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Henri de Feraudy</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-230989</link>
		<dc:creator>Henri de Feraudy</dc:creator>
		<pubDate>Tue, 20 Apr 2010 08:33:24 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-230989</guid>
		<description>It looks like you are just comparing every segment to every other segment for intersection. This is what I did at start, but becomes horribly slow in large data sets. It&#039;s much faster to use the line-sweep algorithm as described in Computational Geometry: Algorithms and Applications by
Marc de Berg et al</description>
		<content:encoded><![CDATA[<p>It looks like you are just comparing every segment to every other segment for intersection. This is what I did at start, but becomes horribly slow in large data sets. It&#8217;s much faster to use the line-sweep algorithm as described in Computational Geometry: Algorithms and Applications by<br />
Marc de Berg et al</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: ibly</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-180501</link>
		<dc:creator>ibly</dc:creator>
		<pubDate>Thu, 13 Aug 2009 04:30:18 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-180501</guid>
		<description>Thanks alot! I&#039;m using this in an iPhone game that I&#039;m working on. All I had to do is port it to Objective C.</description>
		<content:encoded><![CDATA[<p>Thanks alot! I&#8217;m using this in an iPhone game that I&#8217;m working on. All I had to do is port it to Objective C.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: SherlockForms Project BLOG &#187; 如何判定二个点，线或面是否相交</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-58537</link>
		<dc:creator>SherlockForms Project BLOG &#187; 如何判定二个点，线或面是否相交</dc:creator>
		<pubDate>Fri, 28 Mar 2008 03:41:13 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-58537</guid>
		<description>[...] http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/ [...]</description>
		<content:encoded><![CDATA[<p>[...] <a href="http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/" rel="nofollow">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: zack</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-55650</link>
		<dc:creator>zack</dc:creator>
		<pubDate>Mon, 10 Mar 2008 18:44:09 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-55650</guid>
		<description>shouldn&#039;t be surprising... since any sqrt or division leads to a loss in precision... so the order of the math in the algorithm is just as important as which operations to do for both performance and precision.  Any Numerical Analysis textbook can fill you in on the details on why this happens.</description>
		<content:encoded><![CDATA[<p>shouldn&#8217;t be surprising&#8230; since any sqrt or division leads to a loss in precision&#8230; so the order of the math in the algorithm is just as important as which operations to do for both performance and precision.  Any Numerical Analysis textbook can fill you in on the details on why this happens.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: marius watz</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-43136</link>
		<dc:creator>marius watz</dc:creator>
		<pubDate>Mon, 17 Dec 2007 00:36:32 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-43136</guid>
		<description>My algorithm more precise? Now that is a surprise.</description>
		<content:encoded><![CDATA[<p>My algorithm more precise? Now that is a surprise.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: christian</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-43091</link>
		<dc:creator>christian</dc:creator>
		<pubDate>Sun, 16 Dec 2007 10:29:40 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-43091</guid>
		<description>I tried both the algorithms and marius&#039; one generates a more precise result. In my case I needed more precision than performance, cheers!</description>
		<content:encoded><![CDATA[<p>I tried both the algorithms and marius&#8217; one generates a more precise result. In my case I needed more precision than performance, cheers!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: marius watz</title>
		<link>http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/comment-page-1/#comment-33979</link>
		<dc:creator>marius watz</dc:creator>
		<pubDate>Tue, 11 Sep 2007 12:57:37 +0000</pubDate>
		<guid isPermaLink="false">http://workshop.evolutionzone.com/2007/09/10/code-2d-line-intersection/#comment-33979</guid>
		<description>Hi Guillaume, thanks for the code. I knew mine wouldn&#039;t be the fastest but I was happy just to get it working. I&#039;ll try your version now.</description>
		<content:encoded><![CDATA[<p>Hi Guillaume, thanks for the code. I knew mine wouldn&#8217;t be the fastest but I was happy just to get it working. I&#8217;ll try your version now.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
