<?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 for :: JimBlackhurst.com ::</title>
	<atom:link href="http://jimblackhurst.com/wp/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://jimblackhurst.com/wp</link>
	<description>Electronics, Data, Space, Games Design, other random geekieness</description>
	<lastBuildDate>Fri, 04 May 2012 20:02:17 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Bumpy landing on this and other worlds? by Jim</title>
		<link>http://jimblackhurst.com/wp/2008/04/21/bumpy-landing-on-this-and-other-worlds/comment-page-1/#comment-367</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Fri, 04 May 2012 20:02:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.jimblackhurst.com/blog/?p=30#comment-367</guid>
		<description>Totally agree with you on that one Mr. Gagarin, If I ever went into space I&#039;d want to come home with the russians.</description>
		<content:encoded><![CDATA[<p>Totally agree with you on that one Mr. Gagarin, If I ever went into space I&#8217;d want to come home with the russians.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Bumpy landing on this and other worlds? by Gagarin</title>
		<link>http://jimblackhurst.com/wp/2008/04/21/bumpy-landing-on-this-and-other-worlds/comment-page-1/#comment-366</link>
		<dc:creator>Gagarin</dc:creator>
		<pubDate>Fri, 04 May 2012 04:50:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.jimblackhurst.com/blog/?p=30#comment-366</guid>
		<description>Still better than the unsullessly sophisticated  US space shuttle.</description>
		<content:encoded><![CDATA[<p>Still better than the unsullessly sophisticated  US space shuttle.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Treemaps and Processing by fab</title>
		<link>http://jimblackhurst.com/wp/2010/10/21/treemaps-and-processing/comment-page-1/#comment-364</link>
		<dc:creator>fab</dc:creator>
		<pubDate>Wed, 14 Mar 2012 04:39:26 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=155#comment-364</guid>
		<description>perfect !</description>
		<content:encoded><![CDATA[<p>perfect !</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by gregg</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-362</link>
		<dc:creator>gregg</dc:creator>
		<pubDate>Fri, 17 Feb 2012 00:27:51 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-362</guid>
		<description>11 million data points is actually fairly small.  for instance a 3D CT image is typically 20-100 million gray samples. we can render that in volume renderers at 30 FPS with a few pages of openGL code.  it&#039;s actually a homework assignment, and students typically complete it in a few hours. and when real-time texture mapping reaches webGL, you&#039;ll be able to render in browsers.

you also might want to look into compressing your data. after binning your data into discrete pixels, flatten the 3D world into a single 1D array, then just list the positions of the non-zero values each as a single index into this 1D array, so 8 bytes per sample is only 80M bytes.  encode the difference between neighboring pixels (difference of indices) as a distance, gzip, and you&#039;ll get it down to 5MB, depending on the spatial distribution of the points.  simple enough.  oct-trees and other more complex encodings can reduce it more, but there&#039;s no need for that once you&#039;ve hit 5MB.

good luck. keep us updated!</description>
		<content:encoded><![CDATA[<p>11 million data points is actually fairly small.  for instance a 3D CT image is typically 20-100 million gray samples. we can render that in volume renderers at 30 FPS with a few pages of openGL code.  it&#8217;s actually a homework assignment, and students typically complete it in a few hours. and when real-time texture mapping reaches webGL, you&#8217;ll be able to render in browsers.</p>
<p>you also might want to look into compressing your data. after binning your data into discrete pixels, flatten the 3D world into a single 1D array, then just list the positions of the non-zero values each as a single index into this 1D array, so 8 bytes per sample is only 80M bytes.  encode the difference between neighboring pixels (difference of indices) as a distance, gzip, and you&#8217;ll get it down to 5MB, depending on the spatial distribution of the points.  simple enough.  oct-trees and other more complex encodings can reduce it more, but there&#8217;s no need for that once you&#8217;ve hit 5MB.</p>
<p>good luck. keep us updated!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Bumpy landing on this and other worlds? by James</title>
		<link>http://jimblackhurst.com/wp/2008/04/21/bumpy-landing-on-this-and-other-worlds/comment-page-1/#comment-357</link>
		<dc:creator>James</dc:creator>
		<pubDate>Tue, 30 Aug 2011 15:35:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.jimblackhurst.com/blog/?p=30#comment-357</guid>
		<description>Wow, that is a lot of smoke and burnt ground for a small ship coming back to earth.</description>
		<content:encoded><![CDATA[<p>Wow, that is a lot of smoke and burnt ground for a small ship coming back to earth.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by Jim</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-355</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Mon, 18 Jul 2011 17:53:06 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-355</guid>
		<description>hi Aidan!
Thanks for the comment. Yes I&#039;ve seen a lot of comments about the music too, although the answer is a bit less interesting than im sure you hoped for. The music is a licence free track that comes with the pro edition of Sony vegas which I used for the editing. If you are interested, I originally cut the video to &#039;heartbeats&#039; by Jose Gonallez, but wasn&#039;t allowed to publicly release it for copyright reasons. I still think it fits heartbeats better.
Jim</description>
		<content:encoded><![CDATA[<p>hi Aidan!<br />
Thanks for the comment. Yes I&#8217;ve seen a lot of comments about the music too, although the answer is a bit less interesting than im sure you hoped for. The music is a licence free track that comes with the pro edition of Sony vegas which I used for the editing. If you are interested, I originally cut the video to &#8216;heartbeats&#8217; by Jose Gonallez, but wasn&#8217;t allowed to publicly release it for copyright reasons. I still think it fits heartbeats better.<br />
Jim</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by Aidan</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-354</link>
		<dc:creator>Aidan</dc:creator>
		<pubDate>Mon, 11 Jul 2011 14:25:34 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-354</guid>
		<description>Hi Jim,
Love this video. Well done. Quite a few people on youtube (myself included) also love the music used in this video and i&#039;d be eternally grateful if you could let us know what it is as I&#039;d like to hear it in full and more from the same artist.</description>
		<content:encoded><![CDATA[<p>Hi Jim,<br />
Love this video. Well done. Quite a few people on youtube (myself included) also love the music used in this video and i&#8217;d be eternally grateful if you could let us know what it is as I&#8217;d like to hear it in full and more from the same artist.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by Death Map Brings Video Game Kills To Life &#124; Tech News In Australia</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-327</link>
		<dc:creator>Death Map Brings Video Game Kills To Life &#124; Tech News In Australia</dc:creator>
		<pubDate>Sat, 04 Jun 2011 17:58:51 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-327</guid>
		<description>[...] this data and overlay a kill map while you choose which building to enter or which hill to climb. [Jim Blackhurst via Fast Company   Read full post from    Tags : 3d Plane, Anonymous, Blackhurst, Brings, Create [...]</description>
		<content:encoded><![CDATA[<p>[...] this data and overlay a kill map while you choose which building to enter or which hill to climb. [Jim Blackhurst via Fast Company   Read full post from    Tags : 3d Plane, Anonymous, Blackhurst, Brings, Create [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by the geek escape</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-325</link>
		<dc:creator>the geek escape</dc:creator>
		<pubDate>Fri, 03 Jun 2011 18:04:59 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-325</guid>
		<description>[...] and music. He is clearly a data geek and loves it in its raw, visualized form. There is really neat post on his blog about the creation of this video that I recommend if you want to know more.     Posted in Games &#124;  [...]</description>
		<content:encoded><![CDATA[<p>[...] and music. He is clearly a data geek and loves it in its raw, visualized form. There is really neat post on his blog about the creation of this video that I recommend if you want to know more.     Posted in Games |  [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Heatmaps, Point Clouds and Big Data in Processing by Steve</title>
		<link>http://jimblackhurst.com/wp/2011/05/17/heatmaps-point-clouds-and-big-data-in-processing/comment-page-1/#comment-321</link>
		<dc:creator>Steve</dc:creator>
		<pubDate>Thu, 02 Jun 2011 13:10:13 +0000</pubDate>
		<guid isPermaLink="false">http://jimblackhurst.com/wp/?p=213#comment-321</guid>
		<description>Very nice visualization.  Have you considered simply using logarithmic scaling of the colors to avoid the clipping that you mentioned? (&quot;The palette is scaled so that the cell with the largest value of counts is always pure white, so there is no clipping in the colour...&quot;)</description>
		<content:encoded><![CDATA[<p>Very nice visualization.  Have you considered simply using logarithmic scaling of the colors to avoid the clipping that you mentioned? (&#8220;The palette is scaled so that the cell with the largest value of counts is always pure white, so there is no clipping in the colour&#8230;&#8221;)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

