Find out about Radial Treemaps and create your individual with Python

The Treemap Idea

The “Treemap” was launched by Ben Shneiderman on the College of Maryland within the early 1990s¹. Merely put, it’s an environment friendly means of displaying hierarchical knowledge as a set of nested rectangles. Though the idea is straightforward, the association of the rectangles is topic to an aesthetic choice, and varied association algorithms have been developed to boost the looks of the ultimate format.

Treemap Mechanics

Given a hierarchy, a Treemap represents every department within the hierarchy as a rectangle, which is then tiled with smaller rectangles representing sub-branches. The area in a Treemap is split based on a selected attribute of the info (typically measurement or worth), and every rectangle’s space corresponds to the attribute’s magnitude, making it straightforward to check completely different components of the hierarchy.

To account for the association of the rectangles, listed below are a number of the widespread algorithms that govern a Treemap’s building and supreme look:

• Squarified Treemaps² – creates rectangles as near squares as potential by adjusting the facet ratio of the rectangles
• Strip Treemaps³ – lays out the rectangles in strips, both horizontally or vertically, primarily based on the info’s hierarchy
• Slice-and-Dice⁴ – alternates between horizontal and vertical divisions which is easy however can create elongated rectangles

Treemap Options

• Proportions – the scale of every rectangle is proportional to the info level it represents, permitting fast identification of bigger and smaller objects
• Strains and Colours – intelligent utilization of borders, border measurement and shade, and buffers can delineate hierarchy ranges whereas container colours are sometimes used to characterize completely different dimensions of the info
• Spatial Effectivity – Treemaps…