forked from mbostock‘s block: D3 Source Treemap
then forked from timelyportfolio‘s block: D3 Source Treemap (forked for split algo)
Inspired by this discussion, I wanted to try to implement the split algorithm for treemaps. It is still very much a WIP. This represents a quick test for speed on a decently sized random hierarchical data set generated in R by the treemap package.
This treemap shows the file size in bytes of D3 4.4.0’s source code. Click on any cell to view the corresponding source.
forked from timelyportfolio‘s block: Treemap (forked for split speed test)