<?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: Continent Samples</title>
	<atom:link href="http://www.dungeonleague.com/2010/02/15/continent-samples/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dungeonleague.com/2010/02/15/continent-samples/</link>
	<description>Experiments with procedural content generation</description>
	<lastBuildDate>Fri, 08 Jul 2011 08:23:50 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Joshua S.</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-144</link>
		<dc:creator>Joshua S.</dc:creator>
		<pubDate>Fri, 08 Jul 2011 08:23:50 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-144</guid>
		<description>I&#039;ve been searching all over the internet for this sort of thing. It&#039;d be awesome if the steps outlined in the article could be fleshed out into a tutorial of sorts. Then people like me, who find it kinda hard to figure out the specifics, could learn to generate these cool continents. Please consider making one!

love your work!</description>
		<content:encoded><![CDATA[<p>I&#8217;ve been searching all over the internet for this sort of thing. It&#8217;d be awesome if the steps outlined in the article could be fleshed out into a tutorial of sorts. Then people like me, who find it kinda hard to figure out the specifics, could learn to generate these cool continents. Please consider making one!</p>
<p>love your work!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sammual</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-116</link>
		<dc:creator>Sammual</dc:creator>
		<pubDate>Tue, 26 Oct 2010 15:50:39 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-116</guid>
		<description>Any chance I could get the source code you are using for &quot;Build and Normalize Voronoi Diagram&quot; and &quot;Create FBM noise pattern and normalize to 0.0 and 1.0.&quot;?</description>
		<content:encoded><![CDATA[<p>Any chance I could get the source code you are using for &#8220;Build and Normalize Voronoi Diagram&#8221; and &#8220;Create FBM noise pattern and normalize to 0.0 and 1.0.&#8221;?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jordan</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-104</link>
		<dc:creator>Jordan</dc:creator>
		<pubDate>Sat, 18 Sep 2010 23:53:37 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-104</guid>
		<description>I really like that you took your time. Hahaha just joking</description>
		<content:encoded><![CDATA[<p>I really like that you took your time. Hahaha just joking</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jotaf</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-98</link>
		<dc:creator>Jotaf</dc:creator>
		<pubDate>Wed, 25 Aug 2010 15:12:26 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-98</guid>
		<description>John: in python you can avoid the first loop using the built-in max() function, which is faster -- it loops through the elements and selects the greatest number, but implemented in an much more efficient way.

You may also want to check out map, reduce, all, any... which can be helpful in some situations. The module itertools (section 9.7 of the manual) has even more functions; using built-in operators as described at the top of that section of the manual should yield much faster results. Translating loops to this sort of operation can be a bit of a brain-twister though, not all algorithms can be translated, and although I can vouch for the super-speed of functions like max(), I haven&#039;t tested the ones that ask for function handles like the ones in itertools.</description>
		<content:encoded><![CDATA[<p>John: in python you can avoid the first loop using the built-in max() function, which is faster &#8212; it loops through the elements and selects the greatest number, but implemented in an much more efficient way.</p>
<p>You may also want to check out map, reduce, all, any&#8230; which can be helpful in some situations. The module itertools (section 9.7 of the manual) has even more functions; using built-in operators as described at the top of that section of the manual should yield much faster results. Translating loops to this sort of operation can be a bit of a brain-twister though, not all algorithms can be translated, and although I can vouch for the super-speed of functions like max(), I haven&#8217;t tested the ones that ask for function handles like the ones in itertools.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Edward Slimak</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-57</link>
		<dc:creator>John Edward Slimak</dc:creator>
		<pubDate>Fri, 02 Jul 2010 00:50:56 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-57</guid>
		<description>So, I&#039;m attempting to start the whole world generation aspect of my project (in Python) and I&#039;m attempting to implement your algorithm.  I feel like my method is horribly under-optimized and I&#039;m sort of wondering how you chose to normalize your values.  I have to run through the array twice in order to first determine the unnormalized values for each cell and find the maximum value that the array contains and then I run through it again to normalize.  Is there some faster way you&#039;ve done it?</description>
		<content:encoded><![CDATA[<p>So, I&#8217;m attempting to start the whole world generation aspect of my project (in Python) and I&#8217;m attempting to implement your algorithm.  I feel like my method is horribly under-optimized and I&#8217;m sort of wondering how you chose to normalize your values.  I have to run through the array twice in order to first determine the unnormalized values for each cell and find the maximum value that the array contains and then I run through it again to normalize.  Is there some faster way you&#8217;ve done it?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Federico Tomassetti</title>
		<link>http://www.dungeonleague.com/2010/02/15/continent-samples/comment-page-1/#comment-31</link>
		<dc:creator>Federico Tomassetti</dc:creator>
		<pubDate>Sun, 02 May 2010 12:28:26 +0000</pubDate>
		<guid isPermaLink="false">http://dungeonleague.com/?p=59#comment-31</guid>
		<description>It seems to me that you obtained wonderful results and I would be very interested in understand more about how you did.

I am writing too a world-generator in Java. I started playing with the perlin-noise algorithm and then I added some basic tectonics simulation (without it my continents tend to have mountains in the center and then degrades to the ocean).

We could exchange results and code if you like,
I can send to you some screenshots about what I obtained and some more detailed explanation,

Federico</description>
		<content:encoded><![CDATA[<p>It seems to me that you obtained wonderful results and I would be very interested in understand more about how you did.</p>
<p>I am writing too a world-generator in Java. I started playing with the perlin-noise algorithm and then I added some basic tectonics simulation (without it my continents tend to have mountains in the center and then degrades to the ocean).</p>
<p>We could exchange results and code if you like,<br />
I can send to you some screenshots about what I obtained and some more detailed explanation,</p>
<p>Federico</p>
]]></content:encoded>
	</item>
</channel>
</rss>

