<?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"
	>
<channel>
	<title>Comments on: This could work</title>
	<atom:link href="http://blog.xcski.com/2008/03/31/this-could-work/feed" rel="self" type="application/rss+xml" />
	<link>http://blog.xcski.com/2008/03/31/this-could-work</link>
	<description>Everything I used to bore people on newsgroups and mailing lists with, now in one inconvenient place.</description>
	<pubDate>Tue, 07 Oct 2008 09:29:13 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: Herman Varma</title>
		<link>http://blog.xcski.com/2008/03/31/this-could-work#comment-98577</link>
		<dc:creator>Herman Varma</dc:creator>
		<pubDate>Fri, 25 Jul 2008 16:49:23 +0000</pubDate>
		<guid isPermaLink="false">http://blog.xcski.com/2008/03/31/this-could-work#comment-98577</guid>
		<description>Hey long time since I heard from the guy who use to sing Barrett's Privateers over HHCode discussions and beer. Contact me through BIO in Dartmouth NS and I'll see what I can do to give you a hand.

herman varma</description>
		<content:encoded><![CDATA[<p>Hey long time since I heard from the guy who use to sing Barrett&#8217;s Privateers over HHCode discussions and beer. Contact me through BIO in Dartmouth NS and I&#8217;ll see what I can do to give you a hand.</p>
<p>herman varma</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sarah</title>
		<link>http://blog.xcski.com/2008/03/31/this-could-work#comment-83897</link>
		<dc:creator>Sarah</dc:creator>
		<pubDate>Mon, 31 Mar 2008 17:01:22 +0000</pubDate>
		<guid isPermaLink="false">http://blog.xcski.com/2008/03/31/this-could-work#comment-83897</guid>
		<description>Reminds me of a hack I made waaay back when
* mandelbrot sets were newly cool
* computers were slow
* Pen Plotters existed!

I sorted xy-vectors ( and pen color actually ) for large plotter files as part of the plot spool s/w.  These could be generated really stupidly, with long pen movements between vectors.

After sorting, it was kind of fun to watch it draw in Sierpinski sorted order.

Sarah</description>
		<content:encoded><![CDATA[<p>Reminds me of a hack I made waaay back when<br />
* mandelbrot sets were newly cool<br />
* computers were slow<br />
* Pen Plotters existed!</p>
<p>I sorted xy-vectors ( and pen color actually ) for large plotter files as part of the plot spool s/w.  These could be generated really stupidly, with long pen movements between vectors.</p>
<p>After sorting, it was kind of fun to watch it draw in Sierpinski sorted order.</p>
<p>Sarah</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Catsidhe</title>
		<link>http://blog.xcski.com/2008/03/31/this-could-work#comment-83786</link>
		<dc:creator>Catsidhe</dc:creator>
		<pubDate>Mon, 31 Mar 2008 01:38:40 +0000</pubDate>
		<guid isPermaLink="false">http://blog.xcski.com/2008/03/31/this-could-work#comment-83786</guid>
		<description>The quad tree sounds like a hack I came up with lo these many years ago, when Mandelbrot sets were still cool.

The PC I had to code with was slow enough that it would take a day or more to generate a set to cover the screen, so I made a couple of assumptions. I had read that the MS was connected, so my program calculated the pixels around the outside border, then quartered the area. Each quarter was checked if all pixels around the border were identical. If yes, blockfill and move on to the next quarter. If not, move on to the next quadrant, recurse. This algorithm could generate a MS in a couple of hours, by spending al its time on the fiddly bits, and not wasting time on the big flat areas.

I'm still sorta proud of that code.</description>
		<content:encoded><![CDATA[<p>The quad tree sounds like a hack I came up with lo these many years ago, when Mandelbrot sets were still cool.</p>
<p>The PC I had to code with was slow enough that it would take a day or more to generate a set to cover the screen, so I made a couple of assumptions. I had read that the MS was connected, so my program calculated the pixels around the outside border, then quartered the area. Each quarter was checked if all pixels around the border were identical. If yes, blockfill and move on to the next quarter. If not, move on to the next quadrant, recurse. This algorithm could generate a MS in a couple of hours, by spending al its time on the fiddly bits, and not wasting time on the big flat areas.</p>
<p>I&#8217;m still sorta proud of that code.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
