<?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 for Safe from the Losing Fight</title>
	<atom:link href="http://losingfight.com/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://losingfight.com/blog</link>
	<description>because i don&#039;t write software for windows</description>
	<lastBuildDate>Mon, 27 Feb 2012 21:23:01 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Fortunate Bear Acquires Creastoric by Safe from the Losing Fight &#187; I will buy your app (Maybe)</title>
		<link>http://losingfight.com/blog/2012/02/27/fortunate-bear-acquires-creastoric/comment-page-1/#comment-1424</link>
		<dc:creator>Safe from the Losing Fight &#187; I will buy your app (Maybe)</dc:creator>
		<pubDate>Mon, 27 Feb 2012 21:23:01 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=519#comment-1424</guid>
		<description>[...] announced earlier today that my company had acquired Creastoric. I have to admit, I wasn&#8217;t looking to acquire a company or product at the time, so this deal [...]</description>
		<content:encoded><![CDATA[<p>[...] announced earlier today that my company had acquired Creastoric. I have to admit, I wasn&#8217;t looking to acquire a company or product at the time, so this deal [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Our Engineers are Aware of the Issue by Michael Tsai - Blog - Our Engineers Are Aware of the Issue</title>
		<link>http://losingfight.com/blog/2012/01/30/our-engineers-are-aware-of-the-issue/comment-page-1/#comment-1383</link>
		<dc:creator>Michael Tsai - Blog - Our Engineers Are Aware of the Issue</dc:creator>
		<pubDate>Tue, 31 Jan 2012 00:17:59 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=511#comment-1383</guid>
		<description>[...] Andy Finnell: Word on the street (by which I mean Twitter, since we engineers certainly don&#8217;t go outside, much less into the street), is that it&#8217;s supposed to be a &#8220;polite&#8221; way of saying &#8220;we&#8217;re not going to fix it.&#8221; But I&#8217;m not sure why they wouldn&#8217;t just say &#8220;it works as intended&#8221;, which is what they used to say, or simply &#8220;it will not be fixed.&#8221; [...]</description>
		<content:encoded><![CDATA[<p>[...] Andy Finnell: Word on the street (by which I mean Twitter, since we engineers certainly don&rsquo;t go outside, much less into the street), is that it&rsquo;s supposed to be a &ldquo;polite&rdquo; way of saying &ldquo;we&rsquo;re not going to fix it.&rdquo; But I&rsquo;m not sure why they wouldn&rsquo;t just say &ldquo;it works as intended&rdquo;, which is what they used to say, or simply &ldquo;it will not be fixed.&rdquo; [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement boolean operations on bezier paths, Part 1 by Boolean Operations &#124; The Laudun Log</title>
		<link>http://losingfight.com/blog/2011/07/06/how-to-implement-boolean-operations-on-bezier-paths-part-1/comment-page-1/#comment-990</link>
		<dc:creator>Boolean Operations &#124; The Laudun Log</dc:creator>
		<pubDate>Mon, 01 Aug 2011 15:25:27 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=438#comment-990</guid>
		<description>[...] what if Boolean operators were more easily understood? Andy Finnell wrote about Boolean operators in terms of graphics, but his graphical illustrators actually make Boolean operations more understandable to a larger [...]</description>
		<content:encoded><![CDATA[<p>[...] what if Boolean operators were more easily understood? Andy Finnell wrote about Boolean operators in terms of graphics, but his graphical illustrators actually make Boolean operations more understandable to a larger [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement boolean operations on bezier paths, Part 1 by Bezier Path Boolean Ops at Under The Bridge</title>
		<link>http://losingfight.com/blog/2011/07/06/how-to-implement-boolean-operations-on-bezier-paths-part-1/comment-page-1/#comment-980</link>
		<dc:creator>Bezier Path Boolean Ops at Under The Bridge</dc:creator>
		<pubDate>Mon, 11 Jul 2011 06:40:33 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=438#comment-980</guid>
		<description>[...] How to implement boolean operations on bezier paths, Part 1 [...]</description>
		<content:encoded><![CDATA[<p>[...] How to implement boolean operations on bezier paths, Part 1 [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement boolean operations on bezier paths, Part 1 by Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 3</title>
		<link>http://losingfight.com/blog/2011/07/06/how-to-implement-boolean-operations-on-bezier-paths-part-1/comment-page-1/#comment-977</link>
		<dc:creator>Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 3</dc:creator>
		<pubDate>Sat, 09 Jul 2011 07:01:44 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=438#comment-977</guid>
		<description>[...] I covered how to find the intersections between two bezier curves and gave a conceptual overview of how to perform boolean operations on bezier paths. In this final [...]</description>
		<content:encoded><![CDATA[<p>[...] I covered how to find the intersections between two bezier curves and gave a conceptual overview of how to perform boolean operations on bezier paths. In this final [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement boolean operations on bezier paths, Part 1 by Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 2</title>
		<link>http://losingfight.com/blog/2011/07/06/how-to-implement-boolean-operations-on-bezier-paths-part-1/comment-page-1/#comment-974</link>
		<dc:creator>Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 2</dc:creator>
		<pubDate>Fri, 08 Jul 2011 02:52:36 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=438#comment-974</guid>
		<description>[...] my last post I showed how to find the intersection points between two bezier curves. While interesting, it&#8217;s merely a stop on the way to implementing boolean operations for [...]</description>
		<content:encoded><![CDATA[<p>[...] my last post I showed how to find the intersection points between two bezier curves. While interesting, it&#8217;s merely a stop on the way to implementing boolean operations for [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement a vector brush by Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 1</title>
		<link>http://losingfight.com/blog/2011/05/30/how-to-implement-a-vector-brush/comment-page-1/#comment-971</link>
		<dc:creator>Safe from the Losing Fight &#187; How to implement boolean operations on bezier paths, Part 1</dc:creator>
		<pubDate>Thu, 07 Jul 2011 04:58:42 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=420#comment-971</guid>
		<description>[...] After the main intersection loop (in intersectionsWithBezierCurve:usRange:themRange:originalUs:originalThem:) there&#8217;s a bit of code that checks to see if both curves have converged to a point. The loop bails as soon as one curve converges since the math for clipping falls apart as soon as one curve becomes a point. However for implementing the boolean operations, I need good parameter values for both curves. Since I know the 2D intersection point from the curve that converged, and I can guess a reasonable parameter value for the curve that didn&#8217;t, I can use Newton&#8217;s method to refine the parameter value of the curve that didn&#8217;t converge. Fortunately, that&#8217;s something I&#8217;ve done before when fitting curves to points. [...]</description>
		<content:encoded><![CDATA[<p>[...] After the main intersection loop (in intersectionsWithBezierCurve:usRange:themRange:originalUs:originalThem:) there&#8217;s a bit of code that checks to see if both curves have converged to a point. The loop bails as soon as one curve converges since the math for clipping falls apart as soon as one curve becomes a point. However for implementing the boolean operations, I need good parameter values for both curves. Since I know the 2D intersection point from the curve that converged, and I can guess a reasonable parameter value for the curve that didn&#8217;t, I can use Newton&#8217;s method to refine the parameter value of the curve that didn&#8217;t converge. Fortunately, that&#8217;s something I&#8217;ve done before when fitting curves to points. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to implement a vector brush by its monday~ &#124; CactuarJ&#039;s NotePad</title>
		<link>http://losingfight.com/blog/2011/05/30/how-to-implement-a-vector-brush/comment-page-1/#comment-963</link>
		<dc:creator>its monday~ &#124; CactuarJ&#039;s NotePad</dc:creator>
		<pubDate>Mon, 27 Jun 2011 16:06:52 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=420#comment-963</guid>
		<description>[...] How to implement a vector brush    This entry was posted in Programming. Bookmark the permalink.    &#8592; stuff~   LikeBe the first to like this post. [...]</description>
		<content:encoded><![CDATA[<p>[...] How to implement a vector brush    This entry was posted in Programming. Bookmark the permalink.    &larr; stuff~   LikeBe the first to like this post. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on The Fortunate Bear FAQ by Ev</title>
		<link>http://losingfight.com/blog/2011/01/05/the-fortunate-bear-faq/comment-page-1/#comment-839</link>
		<dc:creator>Ev</dc:creator>
		<pubDate>Thu, 06 Jan 2011 06:46:45 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=391#comment-839</guid>
		<description>Congrats, Andy!

I loved the faq. (There&#039;s one thing in particular I really like about it, but I&#039;m pretty sure you know what it was.)

If I used Mac stuff, I&#039;d totally buy your products.

Best,

E</description>
		<content:encoded><![CDATA[<p>Congrats, Andy!</p>
<p>I loved the faq. (There&#8217;s one thing in particular I really like about it, but I&#8217;m pretty sure you know what it was.)</p>
<p>If I used Mac stuff, I&#8217;d totally buy your products.</p>
<p>Best,</p>
<p>E</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Compiling OpenCL Kernels with Xcode by Safe from the Losing Fight » Compiling OpenCL Kernels with Xcode &#124; DevBlogr</title>
		<link>http://losingfight.com/blog/2009/12/17/compiling-opencl-kernels-with-xcode/comment-page-1/#comment-825</link>
		<dc:creator>Safe from the Losing Fight » Compiling OpenCL Kernels with Xcode &#124; DevBlogr</dc:creator>
		<pubDate>Thu, 24 Dec 2009 13:45:24 +0000</pubDate>
		<guid isPermaLink="false">http://losingfight.com/blog/?p=358#comment-825</guid>
		<description>[...] Follow this link: Safe from the Losing Fight » Compiling OpenCL Kernels with Xcode [...]</description>
		<content:encoded><![CDATA[<p>[...] Follow this link: Safe from the Losing Fight » Compiling OpenCL Kernels with Xcode [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

