<?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: The Name of the Node: Image Fill with Spanning Trees</title>
	<atom:link href="http://nodename.com/blog/2009/05/12/the-name-of-the-node/feed/" rel="self" type="application/rss+xml" />
	<link>http://nodename.com/blog/2009/05/12/the-name-of-the-node/</link>
	<description></description>
	<lastBuildDate>Thu, 05 Jan 2012 17:15:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: nodename &#187; Trees Grow</title>
		<link>http://nodename.com/blog/2009/05/12/the-name-of-the-node/comment-page-1/#comment-169085</link>
		<dc:creator>nodename &#187; Trees Grow</dc:creator>
		<pubDate>Mon, 14 Dec 2009 13:54:57 +0000</pubDate>
		<guid isPermaLink="false">http://nodename.com/blog/?p=118#comment-169085</guid>
		<description>[...] minimum spanning trees as shape fills, the moving version of my earlier post The Name of the Node. On each frame one point is added, all the points move, and their spanning trees are drawn. [...]</description>
		<content:encoded><![CDATA[<p>[...] minimum spanning trees as shape fills, the moving version of my earlier post The Name of the Node. On each frame one point is added, all the points move, and their spanning trees are drawn. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nodename &#187; Roll Over, Delaunay: Voronoi Library Goes Open-Source</title>
		<link>http://nodename.com/blog/2009/05/12/the-name-of-the-node/comment-page-1/#comment-169080</link>
		<dc:creator>nodename &#187; Roll Over, Delaunay: Voronoi Library Goes Open-Source</dc:creator>
		<pubDate>Sat, 12 Dec 2009 02:07:16 +0000</pubDate>
		<guid isPermaLink="false">http://nodename.com/blog/?p=118#comment-169080</guid>
		<description>[...] and the Delaunay triangulation, the library also provides the convex hull, minimum and maximum spanning trees, and several other related geometric [...]</description>
		<content:encoded><![CDATA[<p>[...] and the Delaunay triangulation, the library also provides the convex hull, minimum and maximum spanning trees, and several other related geometric [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: sakri</title>
		<link>http://nodename.com/blog/2009/05/12/the-name-of-the-node/comment-page-1/#comment-163463</link>
		<dc:creator>sakri</dc:creator>
		<pubDate>Tue, 12 May 2009 21:47:51 +0000</pubDate>
		<guid isPermaLink="false">http://nodename.com/blog/?p=118#comment-163463</guid>
		<description>Hi, glad to see a good use of the code :)  Very impressive! I was blown away by some of your older posts as well!</description>
		<content:encoded><![CDATA[<p>Hi, glad to see a good use of the code :)  Very impressive! I was blown away by some of your older posts as well!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

