A treemap recursively subdivides area into rectangles; the area of any node in the tree corresponds to its value. This example uses color to encode different packages of the Flare visualization toolkit. Treemap design invented by Ben Shneiderman. Squarified algorithm by Bruls, Huizing and van Wijk. Data courtesy Jeff Heer.
-
-
Save mchelen/20a119fe38dea50fcc79 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<meta charset="utf-8"> | |
<style> | |
body { | |
font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; | |
margin: auto; | |
position: relative; | |
width: 960px; | |
} | |
form { | |
position: absolute; | |
right: 10px; | |
top: 10px; | |
} | |
.node { | |
border: solid 1px white; | |
font: 10px sans-serif; | |
line-height: 12px; | |
overflow: hidden; | |
position: absolute; | |
text-indent: 2px; | |
} | |
</style> | |
<form> | |
<label><input type="radio" name="mode" value="size" checked> Size</label> | |
<label><input type="radio" name="mode" value="count"> Count</label> | |
</form> | |
<script src="http://d3js.org/d3.v3.min.js"></script> | |
<script src="script.js"></script> | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var margin = {top: 40, right: 10, bottom: 10, left: 10}, | |
width = 960 - margin.left - margin.right, | |
height = 500 - margin.top - margin.bottom; | |
var color = d3.scale.category20c(); | |
var treemap = d3.layout.treemap() | |
.size([width, height]) | |
.sticky(true) | |
.value(function(d) { return d.size; }); | |
var div = d3.select("body").append("div") | |
.style("position", "relative") | |
.style("width", (width + margin.left + margin.right) + "px") | |
.style("height", (height + margin.top + margin.bottom) + "px") | |
.style("left", margin.left + "px") | |
.style("top", margin.top + "px"); | |
var foo = { | |
"name":"root", | |
"children":[] | |
}; | |
d3.csv("https://gist.githubusercontent.com/mchelen/b7af91b76ebd24eba437/raw/25f3617903afde58cb5aa6d3c4802e9dab0613c4/file.csv", function(data){ | |
data.forEach(function(d){ | |
// iterate through each row of csv data | |
var newcat = true; // is this a new category? lets assume so & then correct | |
foo.children.forEach( function (child) { | |
if (child.name == d.category) { | |
var baz = {"name":d.item,"size":d.value}; | |
child.children.push(baz); | |
newcat = false; // we matched the category so it's not new | |
} | |
}); | |
if (newcat) { | |
var bar = { | |
"name":d.category, | |
"children": [ | |
{"name":d.item,"size":d.value} | |
] | |
}; | |
foo.children[foo.children.length]=bar; | |
} | |
}); | |
console.log(JSON.stringify(foo,null," ")); | |
var node = div.datum(foo).selectAll(".node") | |
.data(treemap.nodes) | |
.enter().append("div") | |
.attr("class", "node") | |
.call(position) | |
.style("background", function(d) { return d.children ? color(d.name) : null; }) | |
.text(function(d) { return d.children ? null : d.name; }); | |
d3.selectAll("input").on("change", function change() { | |
var value = this.value === "count" | |
? function() { return 1; } | |
: function(d) { return d.size; }; | |
node | |
.data(treemap.value(value).nodes) | |
.transition() | |
.duration(1500) | |
.call(position); | |
}); | |
}); | |
function position() { | |
this.style("left", function(d) { return d.x + "px"; }) | |
.style("top", function(d) { return d.y + "px"; }) | |
.style("width", function(d) { return Math.max(0, d.dx - 1) + "px"; }) | |
.style("height", function(d) { return Math.max(0, d.dy - 1) + "px"; }); | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment