<?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: Two-dimensional spatial hashing with space-filling curves</title>
	<atom:link href="http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/</link>
	<description>Bryan O&#039;Sullivan&#039;s blog</description>
	<lastBuildDate>Wed, 08 Feb 2012 06:41:38 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Mats Rauhala</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-328578</link>
		<dc:creator>Mats Rauhala</dc:creator>
		<pubDate>Wed, 11 Jan 2012 06:39:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-328578</guid>
		<description>Could you point on to some material about hilbert curves, especially about mapping 2d-&gt;1d, 1d-&gt;2d?</description>
		<content:encoded><![CDATA[<p>Could you point on to some material about hilbert curves, especially about mapping 2d-&gt;1d, 1d-&gt;2d?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: taotree</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-321964</link>
		<dc:creator>taotree</dc:creator>
		<pubDate>Sun, 04 Sep 2011 05:29:55 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-321964</guid>
		<description>Thanks for the info and especially the code implementations.

Ezra is correct, there is a typo. I used the code given and it results in incorrect values. I took Ezra&#039;s fix and it looks much better now. It would be nice if the author could correct the code in the post.</description>
		<content:encoded><![CDATA[<p>Thanks for the info and especially the code implementations.</p>
<p>Ezra is correct, there is a typo. I used the code given and it results in incorrect values. I took Ezra&#8217;s fix and it looks much better now. It would be nice if the author could correct the code in the post.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jberryman</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-229804</link>
		<dc:creator>jberryman</dc:creator>
		<pubDate>Thu, 14 May 2009 14:51:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-229804</guid>
		<description>Cool, thanks! I wonder if space-filling curves can be used in functional languages to represent a grid of mutable objects, like a checker board.</description>
		<content:encoded><![CDATA[<p>Cool, thanks! I wonder if space-filling curves can be used in functional languages to represent a grid of mutable objects, like a checker board.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ezra</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-45800</link>
		<dc:creator>Ezra</dc:creator>
		<pubDate>Sun, 13 May 2007 20:10:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-45800</guid>
		<description>Hello--

Is there a typo in the lebesgue algorithm? It appears you&#039;re defining x&#039; and y&#039; and then ignoring them. Is the last line meant to be

    in x&#039; .&#124;. (y&#039; `shiftL` 1)

instead? It seems to work better that way.</description>
		<content:encoded><![CDATA[<p>Hello&#8211;</p>
<p>Is there a typo in the lebesgue algorithm? It appears you&#8217;re defining x&#8217; and y&#8217; and then ignoring them. Is the last line meant to be</p>
<p>    in x&#8217; .|. (y&#8217; `shiftL` 1)</p>
<p>instead? It seems to work better that way.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: DadHacker &#187; Blog Archive &#187; nice</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-9272</link>
		<dc:creator>DadHacker &#187; Blog Archive &#187; nice</dc:creator>
		<pubDate>Mon, 15 Jan 2007 02:02:18 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-9272</guid>
		<description>[...] A nice way to hash a 2-D point, while preserving some locality.Â  Link. [...]</description>
		<content:encoded><![CDATA[<p>[...] A nice way to hash a 2-D point, while preserving some locality.Â  Link. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Malcolm Rowe</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-8611</link>
		<dc:creator>Malcolm Rowe</dc:creator>
		<pubDate>Fri, 12 Jan 2007 15:41:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-8611</guid>
		<description>Nice, I was aware of Hilbert curves, but I hadn&#039;t heard about Lebesgue curves before!

See also: http://xkcd.com/c195.html</description>
		<content:encoded><![CDATA[<p>Nice, I was aware of Hilbert curves, but I hadn&#8217;t heard about Lebesgue curves before!</p>
<p>See also: <a href="http://xkcd.com/c195.html" rel="nofollow">http://xkcd.com/c195.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bryan O'Sullivan</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-8472</link>
		<dc:creator>Bryan O'Sullivan</dc:creator>
		<pubDate>Thu, 11 Jan 2007 16:38:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-8472</guid>
		<description>Ben - a number of years ago, I wrote a spatial database in Scheme, using Hilbert R-trees. The fast Hilbert distance algorithm was a useful little snippet that fit nicely into the constraints of a blog posting :-)</description>
		<content:encoded><![CDATA[<p>Ben &#8211; a number of years ago, I wrote a spatial database in Scheme, using Hilbert R-trees. The fast Hilbert distance algorithm was a useful little snippet that fit nicely into the constraints of a blog posting <img src='http://www.serpentine.com/wordpress/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Patrick MÃ©zard</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-8445</link>
		<dc:creator>Patrick MÃ©zard</dc:creator>
		<pubDate>Thu, 11 Jan 2007 12:59:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-8445</guid>
		<description>For the record, I did performance comparison of Hilbert vs Z-order indexing for a cartographic tiling or Western Europe, mostly containing the road network and water/forest/building features. The indexed database was something like 15/20Gb of vector data, test machine looks like a bi-PIII-700Mhz with 1Gb of memory and SCSI disks (was 7 years ago).

I did not find relevant differences despite what several papers/thesis claim (Moon,Faloutsos&amp;Jagadish 1996, Lawder 2001).  Maybe the code/tests I wrote were incorrect or biased in a manner which invalidated the expected locality gains, anyway nothing spectacular came from it.

I was sorry about it, I thought it was a cool idea. Too bad it just did not work for me.</description>
		<content:encoded><![CDATA[<p>For the record, I did performance comparison of Hilbert vs Z-order indexing for a cartographic tiling or Western Europe, mostly containing the road network and water/forest/building features. The indexed database was something like 15/20Gb of vector data, test machine looks like a bi-PIII-700Mhz with 1Gb of memory and SCSI disks (was 7 years ago).</p>
<p>I did not find relevant differences despite what several papers/thesis claim (Moon,Faloutsos&amp;Jagadish 1996, Lawder 2001).  Maybe the code/tests I wrote were incorrect or biased in a manner which invalidated the expected locality gains, anyway nothing spectacular came from it.</p>
<p>I was sorry about it, I thought it was a cool idea. Too bad it just did not work for me.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ben Collins-Sussman</title>
		<link>http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/comment-page-1/#comment-8444</link>
		<dc:creator>Ben Collins-Sussman</dc:creator>
		<pubDate>Thu, 11 Jan 2007 12:45:33 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/2007/01/11/two-dimensional-spatial-hashing-with-space-filling-curves/#comment-8444</guid>
		<description>Hey Bryan, why the interest in fractal curves?  Are you using them in some application?</description>
		<content:encoded><![CDATA[<p>Hey Bryan, why the interest in fractal curves?  Are you using them in some application?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

