Voronoi Treemaps in D 3

Voronoi treemaps are an alternative to traditional rectangular treemaps for visualizing hierarchical data. Like rectangular treemaps, Voronoi treemaps represent hierarchical data by dividing the canvas region into cells for each node at the top of the hierarchy, and then further dividing each of these cells for the children of those nodes. The organic shapes created by the Voronoi treemap can make it easier to distinguish sibling nodes from nodes in other branches of the hierarchy. Voronoi treemaps can also be fit to nonrectangular canvases, and are often more aesthetically pleasing than rectangular treemaps. In this paper we present our implementation of the current state-of-the-art of Voronoi treemap generation in javascript for use with the D3 web programming framework. We evaluate our contribution in terms of computational speed against previous native impementations of Voronoi treemap generation.