d3.treemapBinary(node, x0, y0, x1, y1)
Recursively partitions the specified nodes into an approximately-balanced binary tree, choosing horizontal partitioning for wide rectangles and vertical partitioning for tall rectangles.
d3.treemapBinary(node, x0, y0, x1, y1)
Recursively partitions the specified nodes into an approximately-balanced binary tree, choosing horizontal partitioning for wide rectangles and vertical partitioning for tall rectangles.
Please login to continue.