<?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: Treemap as Relational Navigation</title>
	<atom:link href="http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/</link>
	<description>Geoff Gaudreault's Flash weblog and source files archive.</description>
	<lastBuildDate>Fri, 03 Sep 2010 11:49:33 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: TheStreetBullFinder</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2914</link>
		<dc:creator>TheStreetBullFinder</dc:creator>
		<pubDate>Sun, 21 Mar 2010 18:30:56 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2914</guid>
		<description>Great code indeed. I&#039;ve used your code on &lt;a href=&quot;www.TheStreetBullFinder.com&quot; target=&quot;_blank&quot;&gt;TheStreetBullFinder&lt;/a&gt; to display stock picks and it&#039;s performance track record. TreeMaps are really puzzling and intriguing way of data presentation&#8230; Thanks.  </description>
		<content:encoded><![CDATA[<p>Great code indeed. I&#039;ve used your code on <a href="www.TheStreetBullFinder.com" target="_blank">TheStreetBullFinder</a> to display stock picks and it&#039;s performance track record. TreeMaps are really puzzling and intriguing way of data presentation&hellip; Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The disappearing act &#124; cathycracks.com</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2570</link>
		<dc:creator>The disappearing act &#124; cathycracks.com</dc:creator>
		<pubDate>Thu, 12 Feb 2009 04:21:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2570</guid>
		<description>[...] the whole movement of social web and information architecture. It&#8217;s nothing new, but treemap has always intrigued me as a different way of delivering [...]</description>
		<content:encoded><![CDATA[<p>[...] the whole movement of social web and information architecture. It&#8217;s nothing new, but treemap has always intrigued me as a different way of delivering [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: AbusedMedia &#187; Blog Archive &#187; TreeMap: recursive algorithm as user interface</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2487</link>
		<dc:creator>AbusedMedia &#187; Blog Archive &#187; TreeMap: recursive algorithm as user interface</dc:creator>
		<pubDate>Sat, 09 Aug 2008 17:54:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2487</guid>
		<description>[...] There are several projects that involve the treemap algorithm out there, but so few are user interfaces. The most famous is NewsMap by Marcos Weskamp, a navigation tool for news feed by google. Another good example come from RoomForMilk developed by NeuroFuzzy whom also did release the source code. Carl Tashian has mocked up a treemapped interface to visualize and navigate through pictures. If I do miss something neat, please let me know.  [...]</description>
		<content:encoded><![CDATA[<p>[...] There are several projects that involve the treemap algorithm out there, but so few are user interfaces. The most famous is NewsMap by Marcos Weskamp, a navigation tool for news feed by google. Another good example come from RoomForMilk developed by NeuroFuzzy whom also did release the source code. Carl Tashian has mocked up a treemapped interface to visualize and navigate through pictures. If I do miss something neat, please let me know.  [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Fabio</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2485</link>
		<dc:creator>Fabio</dc:creator>
		<pubDate>Fri, 08 Aug 2008 12:46:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2485</guid>
		<description>Really smart algorithm! I will try to port it in as3...
Thanx</description>
		<content:encoded><![CDATA[<p>Really smart algorithm! I will try to port it in as3&#8230;<br />
Thanx</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marcus</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2397</link>
		<dc:creator>Marcus</dc:creator>
		<pubDate>Mon, 24 Dec 2007 18:47:50 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2397</guid>
		<description>We will integrate it soon on our Mallorca Network Project. Thanks for that nice piece of code.</description>
		<content:encoded><![CDATA[<p>We will integrate it soon on our Mallorca Network Project. Thanks for that nice piece of code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: geoff</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2033</link>
		<dc:creator>geoff</dc:creator>
		<pubDate>Mon, 02 Oct 2006 02:49:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2033</guid>
		<description>Tom,

I don&#039;t recall the name of the algorithm, but the source is posted &lt;a href=&quot;http://www.neurofuzzy.net/2006/04/28/treemap-php-source-code/&quot; rel=&quot;nofollow&quot;&gt;here&lt;/a&gt; if you want to play with it.</description>
		<content:encoded><![CDATA[<p>Tom,</p>
<p>I don&#8217;t recall the name of the algorithm, but the source is posted <a href="http://www.neurofuzzy.net/2006/04/28/treemap-php-source-code/" rel="nofollow">here</a> if you want to play with it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom in Cala Dor Palma de Mallorca</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-2030</link>
		<dc:creator>Tom in Cala Dor Palma de Mallorca</dc:creator>
		<pubDate>Sun, 01 Oct 2006 11:15:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-2030</guid>
		<description>Very interesting application of a tree map. It’s a nice approach to using treemaps to display a network of information nodes rather than just a tree. However, having the word in the treemap is a little confusing. I would prefer the word to be the title at the top of the treemap and not included (so the treemap represents topics which are related to the selected topic). A breadcrumb trail at the top so you can see where you’ve been would be nice too.

I like the aspect ratio you got from the algorithm. Can I ask which algorithm you implemented?</description>
		<content:encoded><![CDATA[<p>Very interesting application of a tree map. It’s a nice approach to using treemaps to display a network of information nodes rather than just a tree. However, having the word in the treemap is a little confusing. I would prefer the word to be the title at the top of the treemap and not included (so the treemap represents topics which are related to the selected topic). A breadcrumb trail at the top so you can see where you’ve been would be nice too.</p>
<p>I like the aspect ratio you got from the algorithm. Can I ask which algorithm you implemented?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The disappearing act at blog every brand new day</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-407</link>
		<dc:creator>The disappearing act at blog every brand new day</dc:creator>
		<pubDate>Thu, 23 Mar 2006 10:27:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-407</guid>
		<description>[...] I stumbled across neurofuzzy. There are some interesting concept regarding the whole movement of social web and information architecture. It&#8217;s nothing new, but treemap has always intrigued me as a different way of delivering information [...]</description>
		<content:encoded><![CDATA[<p>[...] I stumbled across neurofuzzy. There are some interesting concept regarding the whole movement of social web and information architecture. It&#8217;s nothing new, but treemap has always intrigued me as a different way of delivering information [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: geoff</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-318</link>
		<dc:creator>geoff</dc:creator>
		<pubDate>Wed, 01 Mar 2006 05:01:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-318</guid>
		<description>Thanks.  To be honest, I&#039;m not sure, but I think it&#039;s the pivot-by-middle algorithm, invented by &lt;a href=&quot;http://www.cs.umd.edu/~ben/&quot; rel=&quot;nofollow&quot;&gt;Ben Schneiderman&lt;/a&gt;.  The only difference is that I am cheating by doing a sort by size on the list before I run the algorithm on it.  So, the bigger things end up at the top left, and the smallest at the bottom right.  Professor Schneiderman was more concerned about retaining the natural order of the list, so methinks that made his task harder.

Another thing I didn&#039;t mention, is that you can flip the aspect ratios depending on whether you start by splitting the map horizontally or vertically.  For instance, my map is already very horizontal, and if my first slice is also horizontal, all of my subnodes will end up being very wide, which is good for text.  I ended up going the other way because I thought the more square nodes were easier to see.  Also, it reminded me of a Japanese Tatami room.  : )

The result also seems to vary greatly depending on the number of items in your list.  If you have 64 items, that&#039;s 2 to the seventh power, so you&#039;ll be going 7 slices deep before you start rendering actual nodes.</description>
		<content:encoded><![CDATA[<p>Thanks.  To be honest, I&#8217;m not sure, but I think it&#8217;s the pivot-by-middle algorithm, invented by <a href="http://www.cs.umd.edu/~ben/" rel="nofollow">Ben Schneiderman</a>.  The only difference is that I am cheating by doing a sort by size on the list before I run the algorithm on it.  So, the bigger things end up at the top left, and the smallest at the bottom right.  Professor Schneiderman was more concerned about retaining the natural order of the list, so methinks that made his task harder.</p>
<p>Another thing I didn&#8217;t mention, is that you can flip the aspect ratios depending on whether you start by splitting the map horizontally or vertically.  For instance, my map is already very horizontal, and if my first slice is also horizontal, all of my subnodes will end up being very wide, which is good for text.  I ended up going the other way because I thought the more square nodes were easier to see.  Also, it reminded me of a Japanese Tatami room.  : )</p>
<p>The result also seems to vary greatly depending on the number of items in your list.  If you have 64 items, that&#8217;s 2 to the seventh power, so you&#8217;ll be going 7 slices deep before you start rendering actual nodes.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Trevor Lohrbeer</title>
		<link>http://www.neurofuzzy.net/2006/02/27/treemap-as-relational-navigation/comment-page-1/#comment-317</link>
		<dc:creator>Trevor Lohrbeer</dc:creator>
		<pubDate>Wed, 01 Mar 2006 01:41:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.neurofuzzy.net/?p=33#comment-317</guid>
		<description>I just found the algorithm you used on your post from the 21st. It&#039;s a wonderful algorithm. Do you have a name for it? I&#039;m assuming you invented it, since I haven&#039;t seen that algorithm used anywhere else before. I&#039;d like to use it in our treemap software as an alternative to the squarified and strip layouts.</description>
		<content:encoded><![CDATA[<p>I just found the algorithm you used on your post from the 21st. It&#8217;s a wonderful algorithm. Do you have a name for it? I&#8217;m assuming you invented it, since I haven&#8217;t seen that algorithm used anywhere else before. I&#8217;d like to use it in our treemap software as an alternative to the squarified and strip layouts.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
