<?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: A Simple Procedural Texture Algorithm</title>
	<atom:link href="http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/feed/" rel="self" type="application/rss+xml" />
	<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/</link>
	<description>a programming blog</description>
	<lastBuildDate>Sat, 28 Jan 2012 16:42:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.4</generator>
	<item>
		<title>By: herman.tulleken</title>
		<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/comment-page-1/#comment-8925</link>
		<dc:creator>herman.tulleken</dc:creator>
		<pubDate>Tue, 26 Jan 2010 09:07:45 +0000</pubDate>
		<guid isPermaLink="false">http://code-spot.co.za/?p=207#comment-8925</guid>
		<description>Cool, thanks for the tip!</description>
		<content:encoded><![CDATA[<p>Cool, thanks for the tip!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ofer Ben-Tovim</title>
		<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/comment-page-1/#comment-8909</link>
		<dc:creator>Ofer Ben-Tovim</dc:creator>
		<pubDate>Mon, 25 Jan 2010 18:53:56 +0000</pubDate>
		<guid isPermaLink="false">http://code-spot.co.za/?p=207#comment-8909</guid>
		<description>To speed up an algorithm remember that every memory access takes time. try and have your data in small arrays for instance remember the 3 elements in every line of the square in an array, now when you want to calculate add the last number and substract the first one. this way you use 2 memory accesses instead of 3. it is even faster because normaly the array is stored in the cash and th e image is not.
in essence avoid as much as posible reading the image and use short memory segments</description>
		<content:encoded><![CDATA[<p>To speed up an algorithm remember that every memory access takes time. try and have your data in small arrays for instance remember the 3 elements in every line of the square in an array, now when you want to calculate add the last number and substract the first one. this way you use 2 memory accesses instead of 3. it is even faster because normaly the array is stored in the cash and th e image is not.<br />
in essence avoid as much as posible reading the image and use short memory segments</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: code-spot &#183; A simple texture algorithm &#8211; faster code and more results</title>
		<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/comment-page-1/#comment-52</link>
		<dc:creator>code-spot &#183; A simple texture algorithm &#8211; faster code and more results</dc:creator>
		<pubDate>Mon, 15 Dec 2008 11:27:34 +0000</pubDate>
		<guid isPermaLink="false">http://code-spot.co.za/?p=207#comment-52</guid>
		<description>[...] while back I wrote about a simple texture algorithm that I have been exploring. The Python implementation was very slow – so much, that I decided to [...]</description>
		<content:encoded><![CDATA[<p>[...] while back I wrote about a simple texture algorithm that I have been exploring. The Python implementation was very slow – so much, that I decided to [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: code-spot &#183; A Simple Procedural Texture Algorithm - More Results and Code</title>
		<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/comment-page-1/#comment-21</link>
		<dc:creator>code-spot &#183; A Simple Procedural Texture Algorithm - More Results and Code</dc:creator>
		<pubDate>Fri, 14 Nov 2008 10:27:46 +0000</pubDate>
		<guid isPermaLink="false">http://code-spot.co.za/?p=207#comment-21</guid>
		<description>[...] a previous post I explained a simple algorithm for generating textures. Below are some more examples of the kinds [...]</description>
		<content:encoded><![CDATA[<p>[...] a previous post I explained a simple algorithm for generating textures. Below are some more examples of the kinds [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: code-spot &#183; 5 Tips for Prototyping Slow Algorithms</title>
		<link>http://code-spot.co.za/2008/11/07/a-simple-procedural-texture-algorithm/comment-page-1/#comment-19</link>
		<dc:creator>code-spot &#183; 5 Tips for Prototyping Slow Algorithms</dc:creator>
		<pubDate>Tue, 11 Nov 2008 08:24:37 +0000</pubDate>
		<guid isPermaLink="false">http://code-spot.co.za/?p=207#comment-19</guid>
		<description>[...] Subscribe to feed &#8249; A Simple Procedural Texture Algorithm [...]</description>
		<content:encoded><![CDATA[<p>[...] Subscribe to feed &lsaquo; A Simple Procedural Texture Algorithm [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

